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.
- Multi-level Algorithm Selection for ASP (Q3449227) (← links)
- Characterising and Explaining Inconsistency in Logic Programs (Q3449230) (← links)
- The Design of the Sixth Answer Set Programming Competition (Q3449235) (← links)
- The Semantics of Consistency and Trust in Peer Data Exchange Systems (Q3498459) (← links)
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols (Q3498490) (← links)
- Temporal Equilibrium Logic: A First Approach (Q3523235) (← links)
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption (Q3524923) (← links)
- A Logical Approach to Qualitative and Quantitative Reasoning (Q3524928) (← links)
- An Algorithm for Computing Semi-stable Semantics (Q3524932) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability (Q3534675) (← links)
- Foundations of Onto-Relational Learning (Q3543274) (← links)
- Inductive Negotiation in Answer Set Programming (Q3601788) (← links)
- Modality Argumentation Programming (Q3619462) (← links)
- Dealing Automatically with Exceptions by Introducing Specificity in ASP (Q3638184) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web (Q3638227) (← links)
- On Coherence and Consistence in Fuzzy Answer Set Semantics for Residuated Logic Programs (Q3638391) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Combining Nonmonotonic Knowledge Bases with External Sources (Q3655190) (← links)
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure (Q3727349) (← links)
- Cautious reasoning in ASP via minimal models and unsatisfiable cores (Q4559795) (← links)
- Constraint Answer Set Programming without Grounding (Q4559798) (← links)
- An ASP Methodology for Understanding Narratives about Stereotypical Activities (Q4559812) (← links)
- Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning (Q4559814) (← links)
- Translating LPOD and CR-Prolog<sub>2</sub>into standard answer set programs (Q4559816) (← links)
- RASP and ASP as a fragment of linear logic (Q4583307) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- Some properties of system descriptions of (Q4583309) (← links)
- On deductive bases for paraconsistent answer set semantics (Q4583312) (← links)
- On the relation between SPARQL1.1 and Answer Set Programming (Q4583314) (← links)
- Clingo goes linear constraints over reals and integers (Q4592712) (← links)
- Hybrid conditional planning using answer set programming (Q4592727) (← links)
- Generating explanations for biomedical queries (Q4592972) (← links)
- Characterizing and extending answer set semantics using possibility theory (Q4592973) (← links)
- Improved answer-set programming encodings for abstract argumentation (Q4592988) (← links)
- Dual-normal logic programs – the forgotten class (Q4592993) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
- Fuzzy answer set computation via satisfiability modulo theories (Q4592999) (← links)
- Taming primary key violations to query large inconsistent data via ASP (Q4593009) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Justifying answer sets using argumentation (Q4593019) (← links)
- Modular action language (Q4593024) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- A model building framework for answer set programming with external computations (Q4593036) (← links)
- Disjunctive answer set solvers via templates (Q4593037) (← links)
- Anytime answer set optimization via unsatisfiable core shrinking (Q4593041) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- Justifications for programs with disjunctive and causal-choice rules (Q4593044) (← links)
