Pages that link to "Item:Q3694733"
From MaRDI portal
The following pages link to Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption (Q3694733):
Displayed 22 items.
- Static filtering on stratified programs (Q688228) (← links)
- Strict completion of logic programs (Q751309) (← links)
- The Prolog not-predicate and negation as failure rule (Q918193) (← links)
- A new deductive approach to planning (Q922685) (← links)
- Closed world assumptions having precedence in predicates (Q922726) (← links)
- Closed-world databases and circumscription (Q1079022) (← links)
- Domain-independent formulas and databases (Q1092679) (← links)
- Negation as failure: careful closure procedure (Q1097727) (← links)
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions (Q1101250) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- Minimalism, justification and non-monotonicity in deductive databases (Q1123011) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Unfold/fold transformation of stratified programs (Q1177929) (← links)
- Complete extension of general logic programs (Q1190477) (← links)
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs (Q1199545) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Compiling dyadic first-order specifications into map algebra (Q1870581) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Well-founded and stationary models of logic programs (Q1924748) (← links)
- Intuitionistic three-valued logic and logic programming (Q3991300) (← links)
- Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints (Q5140015) (← links)
- Goals and benchmarks for automated map reasoning (Q5927984) (← links)
