Pages that link to "Item:Q1363783"
From MaRDI portal
The following pages link to Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783):
Displaying 46 items.
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
- Computing only minimal answers in disjunctive deductive databases (Q1040782) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Extending and implementing the stable model semantics (Q1603743) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Autoepistemic answer set programming (Q2046018) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)
- Any-world assumptions in logic programming (Q2566297) (← links)
- Epistemic logic programs: a study of some properties (Q2694560) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- Stepwise Debugging of Description-Logic Programs (Q2900544) (← links)
- Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
- Transition systems for model generators—A unifying approach (Q3087449) (← links)
- Bottom-up computation of perfect models for disjunctive theories (Q3128528) (← links)
- Progress in clasp Series 3 (Q3449220) (← links)
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption (Q3524923) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Catching the Ouroboros: On debugging non-ground answer-set programs (Q3585165) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Well-founded operators for normal hybrid MKNF knowledge bases (Q4592713) (← links)
- Disjunctive answer set solvers via templates (Q4593037) (← links)
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (Q4649728) (← links)
- Omission-Based Abstraction for Answer Set Programs (Q4957218) (← links)
- Splitting Epistemic Logic Programs (Q4957221) (← links)
- Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting (Q5108495) (← links)
- Incremental Answer Set Programming with Overgrounding (Q5108513) (← links)
- Incremental maintenance of overgrounded logic programs with tailored simplifications (Q5140010) (← links)
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets (Q5445291) (← links)
- Abstract Answer Set Solvers (Q5504668) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- Abstraction for non-ground answer set programs (Q5919127) (← links)
- Thirty years of Epistemic Specifications (Q6085582) (← links)
- Signed dual tableaux for Kleene answer set programs (Q6599615) (← links)
- Epistemic logic programs: a study of some properties (Q6656459) (← links)
