Filters








111,835 Hits in 4.8 sec

Order and Negation as Failure [chapter]

Davy Van Nieuwenborgh, Dirk Vermeir
2003 Lecture Notes in Computer Science  
Interestingly, allowing negation as failure in ordered logic programs does not yield any extra computational power: the combination of negation as failure and order can be simulated using order (and true  ...  We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs.  ...  [23] , demonstrating that order is at least as expressive as negation as failure.  ... 
doi:10.1007/978-3-540-24599-5_14 fatcat:uu5d7y3jp5afxj3bntapkxa7t4

Web Rules Need Two Kinds of Negation [chapter]

Gerd Wagner
2003 Lecture Notes in Computer Science  
In natural language, and in some knowledge representation systems, such as extended logic programs, there are two kinds of negation: a weak negation expressing non-truth, and a strong negation expressing  ...  In this paper I argue that, like in several basic computational languages, such as OCL and SQL, two kinds of negation are also needed in the Semantic Web.  ...  Having negated RDF facts, and open and closed predicates, suggests to use both strong negation as well as negation-as-failure in RDF queries.  ... 
doi:10.1007/978-3-540-24572-8_3 fatcat:nsernefakvdwlknmx7dkbhm7de

Combining explicit negation and negation by failure via Belnap's logic

Paul Ruet, François Fages
1997 Theoretical Computer Science  
This paper deals with logic programs containing two kinds of negation: negation as failure and explicit negation.  ...  Such programs have been introduced by Gelfond and Lifschitz and called extended programs.  ...  In order to do this, one has to distinguish between two kinds of negation: explicit negation (denoted -) and negation as failure (denoted I).  ... 
doi:10.1016/s0304-3975(96)00125-9 fatcat:kjl5vu2jvrezjllgmzx4ictb2m

Page 5012 of Mathematical Reviews Vol. , Issue 2001G [page]

2001 Mathematical Reviews  
The two basic styles of negation are considered, “negation-as-failureand “strong negation”.  ...  The two styles of negation involved can be understood as follows within the stable model semantics: strong negation is pre- cisely Nelson’s strong negation or “constructible falsity”, while negation-as-failure  ... 

What part of no do children not understand? A usage-based account of multiword negation

THEA CAMERON-FAULKNER, ELENA LIEVEN, ANNA THEAKSTON
2007 Journal of Child Language  
Two analyses were conducted : firstly, the emergence and usage of all negators in Brian's speech and in the input were calculated in order to present an overall picture of negator usage across the sample  ...  The focus of the study was the emergence and usage of negators in the child's and mother's speech (e.g. no, not, can't, won't, don't).  ...  The frequency of negators as a proportion of all negated utterances was calculated for the mother's speech in the 2; 1 and 2; 8 samples in order to ascertain whether any differences existed between the  ... 
doi:10.1017/s0305000906007884 fatcat:n7ecp5gdazberaefrsmcdkkb3i

Preferred answer sets for ordered logic programs

DAVY VAN NIEUWENBORGH, DIRK VERMEIR
2006 Theory and Practice of Logic Programming  
We characterize the expressiveness of the resulting semantics and show that it can simulate negation as failure as well as disjunction.  ...  We show that such a rule order induces a natural order on extended answer sets, the minimal elements of which we call preferred answer sets.  ...  Consider the function to behave as negation as failure, under the preferred answer set semantics.In general, we can easily simulate negation as failure using classical negation and a trivial ordering  ... 
doi:10.1017/s1471068404002315 fatcat:35lzz6can5e3pa3v7rxtjrrmcm

Preferred Answer Sets for Ordered Logic Programs [chapter]

Davy Van Nieuwenborgh, Dirk Vermeir
2002 Lecture Notes in Computer Science  
We characterize the expressiveness of the resulting semantics and show that it can simulate negation as failure as well as disjunction.  ...  We show that such a rule order induces a natural order on extended answer sets, the minimal elements of which we call preferred answer sets.  ...  Consider the function to behave as negation as failure, under the preferred answer set semantics.In general, we can easily simulate negation as failure using classical negation and a trivial ordering  ... 
doi:10.1007/3-540-45757-7_36 fatcat:z34yqiihr5h4hmawclmdklnnxe

Page 625 of The Philosophical Review Vol. 28, Issue 6 [page]

1919 The Philosophical Review  
] is the failure of construction and science and statesmanship as a socialistic means.  ...  Such an utterance is itself a confession of the failure of conservatism to see in a new idea anything except the bare negation of the old and the customary.  ... 

Page 556 of Psychological Bulletin Vol. 33, Issue 7 [page]

1936 Psychological Bulletin  
If we symbolize these four simple emotions as A, B, C, D, in the order above named, the following complex ones may be formulated.  ...  , the demal of a volition, the negation of the j attributes of will or again the revelation of a lower degree of wi (p. 52) Anticipated failure or success (fear and desire for assurance) is fundamental  ... 

Page 556 of Psychological Bulletin Vol. 33, Issue 7 [page]

1936 Psychological Bulletin  
If we symbolize these four simple emotions as A, B, C, D, in the order above named, the following complex ones may be formulated.  ...  Thus by combination four simple emotions emerge: in the case of solidarity, affirmation and negation arouse respectively admiration and compassion; in the case of opposition, affirmation and negation of  ... 

ACDC: Altering Control Dependence Chains for Automated Patch Generation [article]

Rawad Abou Assi, Chadi Trad, Wes Masri
2017 arXiv   pre-print
Once a failure is observed, the primary concern of the developer is to identify what caused it in order to repair the code that induced the incorrect behavior.  ...  The aim of this work is to devise an automated patch generation technique that proceeds as follows: Step1) It identifies a set of failure-causing control dependence chains that are minimal in terms of  ...  and the failure.  ... 
arXiv:1705.00811v1 fatcat:jzsymsfrojcmnluzbcg7hy3ase

Page 400 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
Nevertheless, negation in logic programming—namely: the negation as failure rule and SLDNF-resolution—is very different from the logical classical negation.  ...  Thus negation as failure looks very much like a modal operator which would characterize some idea of provability.  ... 

Guest editors

Seif Haridi, Robert Keller
1989 The Journal of Logic Programming  
Most logic-programming languages define negation as finite failure. The fifth paper, "Negation as Failure Using Tight Derivations for General Logic Programs", by A.  ...  We hope the reader will find the papers in this issue as informative and valuable as we did.  ... 
doi:10.1016/0743-1066(89)90027-7 fatcat:g25fti6o2ndl5dpasya6hhmixy

Negation in conclog [chapter]

J. -M. Jacquet
1992 Lecture Notes in Computer Science  
Referring to the completion understanding of the programs, this model has been proved sound and as complete as possible when the resolution rule and the negation-as-failure rule are used.  ...  This paper presents a new constructive form of the negation-as-failure rule dedicated to concurrent executions and, based on it, a parallel execution model of general Horn clauses.  ...  negation as failure rule and the resolution rule are used.  ... 
doi:10.1007/3-540-55437-8_88 fatcat:kb7mtfvkgzd55clohi7u5lhlom

Minimum model semantics for logic programs with negation-as-failure

Panos Rondogiannis, William W. Wadge
2005 ACM Transactions on Computational Logic  
Negation is interpreted as reflection about Zero followed by a step towards Zero; the only truth value that remains unaffected by negation is Zero.  ...  In our semantics, the meaning of a program is, as in the classical case, the unique minimum model in a program-independent ordering.  ...  ACKNOWLEDGMENTS We wish to thank Maarten van Emden, Bruce Kapron, Christos Nomikos and John Schlipf for their comments on earlier versions of this article.  ... 
doi:10.1145/1055686.1055694 fatcat:x337lgp6h5gvhe27k3it7vxcpe
« Previous Showing results 1 — 15 out of 111,835 results