Pages that link to "Item:Q1924780"
From MaRDI portal
The following pages link to On the computational cost of disjunctive logic programming: Propositional case (Q1924780):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- The complexity of computing minimal unidirectional covering sets (Q372959) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← 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)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← 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)
- The complexity and generality of learning answer set programs (Q1647512) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← 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)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- Learning Boolean controls in regulated metabolic networks: a case-study (Q2142113) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface (Q2299238) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Strong inconsistency (Q2321259) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms (Q2353982) (← 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)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving problems in the polynomial hierarchy with ASP(Q) (Q2694590) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- Active integrity constraints and revision programming (Q2884257) (← links)
