Pages that link to "Item:Q1924819"

The following pages link to Propositional semantics for disjunctive logic programs (Q1924819):

Displayed 26 items.

• Enhancing disjunctive logic programming systems by SAT checkers (Q814529) ‎ (← links)
• ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) ‎ (← links)
• Answer set programming based on propositional satisfiability (Q861709) ‎ (← links)
• Stable models and difference logic (Q1028651) ‎ (← links)
• Computing only minimal answers in disjunctive deductive databases (Q1040782) ‎ (← links)
• Reasoning with minimal models: efficient algorithms and applications (Q1127346) ‎ (← links)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) ‎ (← links)
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) ‎ (← links)
• Polynomial-time computable stable models (Q1380428) ‎ (← links)
• Fixed-parameter tractability of disjunction-free default reasoning (Q1400063) ‎ (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) ‎ (← links)
• On the computational cost of disjunctive logic programming: Propositional case (Q1924780) ‎ (← links)
• Connections between default reasoning and partial constraint satisfaction (Q1961815) ‎ (← links)
• Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) ‎ (← links)
• Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) ‎ (← links)
• Semantic forgetting in answer set programming (Q2389674) ‎ (← links)
• Outlier detection using default reasoning (Q2389688) ‎ (← links)
• Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) ‎ (← links)
• On look-ahead heuristics in disjunctive logic programming (Q2426102) ‎ (← links)
• An incremental algorithm for generating all minimal models (Q2457647) ‎ (← links)
• Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) ‎ (← links)
• On the complexity of identifying head-elementary-set-free programs (Q3400962) ‎ (← links)
• Finding Reductions Automatically (Q3586003) ‎ (← links)
• Answer Set Programming: A Primer (Q3638997) ‎ (← links)
• Some (in)translatability results for normal logic programs and propositional theories (Q3647255) ‎ (← links)
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) ‎ (← links)