Logic programming and negation: A survey

The Journal of Logic Programming

Volumn 19-20, Issue SUPPL. 1, 1994, Pages 9-71

  Apt, Krzysztof R ^a   Bol, Roland N ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; THEOREM PROVING;

AUTOEPISTEMIC LOGIC; CIRCUMSCRIPTION METHOD; DEFAULT THEORY; NONMONOTONIC REASONING; PROOF THEORY; SEMANTICS;

LOGIC PROGRAMMING;

EID: 0028425519     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(94)90024-8     Document Type: Article

References (164)

1. On logic program semantics with two kinds of negation
2. Logic Programming
3. Acyclic programs
4. Arithmetic classification of perfect models of stratified programs
5. Reasoning about termination of pure Prolog programs
6. On the occur-check free Prolog programs
7. Contributions to the theory of logic programming
8. Towards a theory of declarative knowledge
9. On the safe termination of Prolog programs
10. A new definition of SLDNF-resolution
11. Efficient bottom-up computation of queries on stratified databases
12. Generalized well-founded semantics for logic programs
13. Generalized disjunctive well-founded semantics for logic programs
14. 3: A semantics for negation in normal disjunctive logic programs
15. Stable and extension class theory for logic programs and default logics
16. Models of completion for some classes of logic programs
17. A transformational approach to negation in logic programming
18. From program completion to default logic
19. Negation in rule-based database languages: a survey
20. General logical databases and programs: Default logic semantics and stratification
21. Negation by default and unstratifiable logic programs
22. WELL!: An evaluation procedure for all logic programs
23. Loop checking and negation
24. Tabulated resolution for well-founded semantics
25. Unsolvable decision problems for Prolog programs
26. A survey on complexity results for non-monotonic logics
27. Continuity, consistency, and completeness properties for logic programs
28. Acyclic programs and the completeness of SLDNF-resolution
29. A completeness theorem for SLDNF resolution
30. A linear semantics for allowed logic programs
31. A linear axiomatization of negation as failure
32. Horn clause queries and generalizations
33. The strong semantics for logic programs
34. Logic-programming schemes and their implementation
35. Negation as failure
36. Graph properties for normal logic programs
37. Generalizing allowedness while retaining completeness of SLDNF resolution
38. Classifying semantics of logic programs
39. A framework for representing and characterizing semantics of logic programs
40. Semantics of logic programs: Their intuitions and formal properties. An overview
41. A classification-theory of semantics of normal logic programs: I. Strong principles
42. A classification-theory of semantics of normal logic programs: II. Weak principles
43. Levationis laus
44. What is failure? An approach to constructive negation
45. Strict completion of logic programs
46. On the relation between stable and well-founded semantics of logic programs
47. Logic characterizations of non-monotonic TMSs
48. A rational reconstruction of nonmonotonic truth maintenance systems
49. Negation-as-failure as an approach to the Hanks and McDermott problem
50. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics
51. Consistency of Clark's completion and existence of stable models
52. A Kripke-Kleene semantics for general logic programs
53. The family of stable models
54. Metric methods; three examples and a theorem
55. The alternating fixpoint of logic programs with negation
56. The well-founded semantics for general logic programs
57. On stratified auto-epistemic theories
58. Compiling circumscriptive theories into logic programs
59. Classical negation in logic programs and disjunctive databases
60. On the relationship between circumscription and negation as failure
61. Linear logic
62. Nonmonotonic logic and temporal projection
63. The Gödel programming language
64. Cautious backtracking and well-founded semantics in truth maintenance systems
65. Abductive logic programming
66. Elements of relational database theory
67. Completeness of a top-down query evaluation procedure for stratified databases
68. Predicate logic as a programming language
69. Nonmonotonic reasoning, preferential models and cumulative logics
70. Negation in logic programming
71. Signed data dependencies in logic programs
72. Making default inferences from logic programs
73. On the declarative semantics of logic programs with negation
74. Making PROLOG more expressive
75. A basis for deductive database systems II
76. Integrity constraint checking in stratified databases
77. Laziness in Logic Programming
78. General patterns in nonmonotonic reasoning
79. Intensional Negation of Logic Programs
80. Proving run-time properties of general logic programs w.r.t. constructive negation
81. Stable semantics for logic programs and default theories
82. A new SLDNF-tree
83. Circumscription—a form of non-monotonic reasoning
84. On indefinite data bases and the closed world assumption
85. Semantics for disjunctive logic programs with explicit and default negation
86. Semantical considerations on non-monotonic logic
87. Implementing semantics for disjunctive logic programs using fringes and abstract properties
88. An Introduction to MU-PROLOG
89. Negation and quantifiers in NU-Prolog
90. Database updates in logic programming
91. Derivation procedures for extended stable models
92. Adding closed world assumptions to well founded semantics
93. Semantic issues in deductive databases and logic programs
94. Stationary extensions of default theories
95. Soundness and completeness of partial deductions for well-founded semantics
96. Weakly stratified logic programs
97. On the declarative and procedural semantics of logic programs
98. Stationary semantics for normal and disjunctive logic programs
99. On the declarative semantics of logic programs with negation
100. Every logic program has a natural stratification and an iterated fixed point model
101. Non-monotonic reasoning vs. logic programming: A new perspective
102. Stationary semantics for disjunctive logic programs and deductive databases
103. The well-founded semantics coincides with the three-valued stable semantics
104. Stable semantics for disjunctive programs
105. Three-valued non-monotonic formalisms and semantics of logic programs
106. Weak generalized closed world assumption
107. A stratification semantics for general disjunctive programs
108. Fundamentals and Logical Foundations of Truth Maintenance
109. On closed world data bases
110. A logic for default theory
111. The well-founded semantics for disjunctive logic programs
112. A procedural semantics for well-founded negation in logic programs
113. Inferring negative information from disjunctive databases
114. Modular acyclicity and tail recursion in logic programs
115. Stable models and non-determinism in logic programs with negation
116. A theorem-proving approach to database integrity
117. Completed logic programs and their consistency
118. The expressive powers of the logic programming semantics
119. A sound and complete semantics for a version of negation as failure
120. Correct answers to allowed queries are ground
121. Negation in logic programming for general logic programs
122. SLDNF resolution with equality
123. A complete axiomatization of the three-valued completion of logic programs
124. The Proof Theory of Logic Programs with Negation
125. Input/output dependencies of normal logic programs
126. A completeness result for SLDNF resolution
127. Constructive negation for constraint logic programming
128. A characterization of stable models using a non-monotonic operator
129. The semantics of predicate logic as a programming language
130. Negation as failure using tight derivations for general logic programs
131. Vivid Logic—Knowledge-Based Reasoning with Two Kinds of Negation
132. Tight, consistent, and computable completions for unrestricted logic programs
133. Partial semantics for truth maintenance