Pages that link to "Item:Q1924780"

The following pages link to On the computational cost of disjunctive logic programming: Propositional case (Q1924780):

Displayed 29 items.

• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) ‎ (← links)
• Enhancing disjunctive logic programming systems by SAT checkers (Q814529) ‎ (← links)
• Equivalence issues in abduction and induction (Q833733) ‎ (← links)
• Equilibrium logic (Q854969) ‎ (← links)
• Reasoning under minimal upper bounds in propositional logic (Q861253) ‎ (← links)
• Computing only minimal answers in disjunctive deductive databases (Q1040782) ‎ (← 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)
• Abduction from logic programs: Semantics and complexity (Q1389684) ‎ (← links)
• Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) ‎ (← links)
• Extending and implementing the stable model semantics (Q1603743) ‎ (← links)
• Propositional default logics made easier: computational complexity of model checking. (Q1853549) ‎ (← links)
• Brave induction: a logical framework for learning from incomplete information (Q1959490) ‎ (← links)
• Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) ‎ (← links)
• Combining answer set programming with description logics for the semantic web (Q2389666) ‎ (← 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)
• Characterising equilibrium logic and nested logic programs: Reductions and complexity, (Q3181745) ‎ (← links)
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols (Q3498490) ‎ (← links)
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) ‎ (← links)
• Brave Induction (Q3543278) ‎ (← links)
• Inductive Negotiation in Answer Set Programming (Q3601788) ‎ (← links)
• Answer Set Programming: A Primer (Q3638997) ‎ (← links)
• Relativized hyperequivalence of logic programs for modular programming (Q3648358) ‎ (← links)
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) ‎ (← links)
• Declarative Semantics for Active Integrity Constraints (Q5504661) ‎ (← links)
• Closed world assumption for disjunctive reasoning (Q5959358) ‎ (← links)