Pages that link to "Item:Q1115208"
From MaRDI portal
The following pages link to An algorithm to compute circumscription (Q1115208):
Displayed 32 items.
- Generating all maximal models of a Boolean expression (Q294760) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Reconsideration of circumscriptive induction with pointwise circumscription (Q833732) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- A Prolog technology theorem prover: A new exposition and implementation in Prolog (Q1199932) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- A three-valued semantics for deductive databases and logic programs (Q1337468) (← links)
- Formalizing incomplete knowledge in incomplete databases (Q1337644) (← links)
- A tableau prover for domain minimization (Q1344878) (← links)
- Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction (Q1344881) (← links)
- Tableau-based characterization and theorem proving for default logic (Q1344885) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Preprocessing of intractable problems (Q1854544) (← links)
- ECWA made easy (Q1924727) (← links)
- Modular specifications with supernormal defaults (Q1924749) (← links)
- First order LUB approximations: characterization and algorithms (Q2457687) (← links)
- An extension of pointwise circumscription (Q2676573) (← links)
- Embedding prioritized circumscription in disjunctive logic programs (Q4421251) (← links)
- Embedding Logics in the Local Computation Framework (Q4443007) (← links)
- A tableau calculus for minimal model reasoning (Q4645243) (← links)
- Embedding circumscriptive theories in general disjunctive programs (Q5101461) (← links)
- Conservative query normalization on parallel circumscription (Q5210781) (← links)
- An abductive framework for negation in disjunctive logic programming (Q5236438) (← links)