Pages that link to "Item:Q3983043"
From MaRDI portal
The following pages link to Classical negation in logic programs and disjunctive databases (Q3983043):
Displaying 50 items.
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Tractable reasoning using logic programs with intensional concepts (Q2055806) (← links)
- Testing in ASP: revisited language and programming environment (Q2055810) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Possible models computation and revision -- a practical approach (Q2096456) (← links)
- Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- Analogical proportions (Q2149806) (← links)
- Lifting symmetry breaking constraints with inductive logic programming (Q2163186) (← links)
- Default reasoning using classical logic (Q2171265) (← links)
- Learning higher-order logic programs (Q2203320) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- A general approach to reasoning with probabilities (Q2283285) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Autoepistemic equilibrium logic and epistemic specifications (Q2307335) (← links)
- Multi-context systems in dynamic environments (Q2317972) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- P-log: refinement and a new coherency condition (Q2317975) (← links)
- Strong inconsistency (Q2321259) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- The dramatic true story of the frame default (Q2341259) (← 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)
- Fuzzy autoepistemic logic and its relation to fuzzy answer set programming (Q2351607) (← links)
- Disjunctive logic programming with types and objects: the \(\mathrm{DLV}^{+}\) system (Q2372203) (← links)
- Deductive databases for computing certain and consistent answers from mediated data integration systems (Q2386182) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← 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)
- Probabilistic reasoning in a classical logic (Q2390656) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Characterizing causal action theories and their implementations in answer set programming (Q2407453) (← links)
- Infinitary equilibrium logic and strongly equivalent logic programs (Q2407875) (← links)
- An argumentation system for defeasible reasoning (Q2409094) (← links)
- Lpopt: a rule optimization tool for answer set programming (Q2409731) (← links)
- An algebraic approach to revising propositional rule-based knowledge bases (Q2425850) (← 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)
- Enhancing DLV instantiator by backjumping techniques (Q2426106) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- A neural cognitive model of argumentation with application to legal inference and decision making (Q2447172) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- An incremental algorithm for generating all minimal models (Q2457647) (← links)
