The following pages link to Stable models and circumscription (Q543596):
Displaying 43 items.
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Relating constraint answer set programming languages and algorithms (Q490456) (← links)
- John McCarthy's legacy (Q543573) (← links)
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- Extended RDF: computability and complexity issues (Q905991) (← links)
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Revising event calculus theories to recover from unexpected observations (Q2029718) (← links)
- Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) (Q2082509) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Arguing correctness of ASP programs with aggregates (Q2694567) (← links)
- Semantics for conditional literals via the SM operator (Q2694573) (← links)
- On elementary loops of logic programs (Q2884258) (← links)
- Lifschitz and Circumscription (Q2900534) (← links)
- Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming (Q2900536) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Representing first-order causal theories by logic programs (Q2909525) (← links)
- System aspmt2smt: Computing ASPMT Theories by SMT Solvers (Q2938519) (← links)
- ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories (Q3449232) (← links)
- Functional completion (Q4583310) (← links)
- Program completion in the input language of GRINGO (Q4592711) (← links)
- Representing hybrid automata by action language modulo theories (Q4592716) (← links)
- An event calculus production rule system for reasoning in dynamic and uncertain domains (Q4593031) (← links)
- First-order modular logic programs and their conservative extensions (Q4593056) (← links)
- Stable models for infinitary formulas with extensional atoms (Q4593057) (← links)
- Non-monotonic spatial reasoning with answer set programming modulo theories (Q4593084) (← links)
- Relational theories with null values and non-herbrand stable models (Q4911135) (← links)
- Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (Q4911144) (← links)
- Module theorem for the general theory of stable models (Q4911145) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- Verifying Tight Logic Programs with anthem and vampire (Q5140011) (← links)
- Modular Answer Set Programming as a Formal Specification Language (Q5140013) (← links)
- Preferred First-Order Answer Set Programs (Q5169967) (← links)
- Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)
- Lloyd-Topor completion and general stable models (Q5398291) (← links)
- Disjunctive logic programs with existential quantification in rule heads (Q5398295) (← links)
- On the stable model semantics for intensional functions (Q5398316) (← links)
- Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Q6063873) (← links)
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs (Q6063883) (← links)
