Pages that link to "Item:Q5473965"
From MaRDI portal
The following pages link to Logic Programming and Nonmonotonic Reasoning (Q5473965):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Stable models and circumscription (Q543596) (← links)
- From answer set logic programming to circumscription via logic of GK (Q543597) (← 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)
- The loop formula based semantics of description logic programs (Q764312) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Equilibrium logic (Q854969) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- General default logic (Q987485) (← links)
- Automated verification of state sequence invariants in general game playing (Q1761287) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- An abstract view on optimizations in SAT and ASP (Q2055811) (← links)
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
- Infinitary equilibrium logic and strongly equivalent logic programs (Q2407875) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- On the Expressiveness of Temporal Equilibrium Logic (Q2835869) (← links)
- From Turner’s Logic of Universal Causation to the Logic of GK (Q2900533) (← 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)
- Online Action Language $$o\mathcal {BC}$$+ (Q3449194) (← links)
- Infinitary Equilibrium Logic and Strong Equivalence (Q3449222) (← links)
- ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories (Q3449232) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- Thirteen Definitions of a Stable Model (Q3586017) (← links)
- Temporal equilibrium logic: a survey (Q4583305) (← links)
- Model-based recasting in answer-set programming (Q4583308) (← links)
- Program completion in the input language of GRINGO (Q4592711) (← links)
- On equivalence of infinitary formulas under the stable model semantics (Q4592970) (← links)
- Abstract gringo (Q4592989) (← links)
- Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
- A denotational semantics for equilibrium logic (Q4593002) (← links)
- An infinitary encoding of temporal equilibrium logic (Q4593006) (← 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)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (Q4649731) (← links)
- ASP-Core-2 Input Language Format (Q4957196) (← links)
- Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language + (Q4957223) (← links)
- (Q5020979) (← links)
- Revisiting Explicit Negation in Answer Set Programming (Q5108509) (← links)
- Relating Two Dialects of Answer Set Programming (Q5108518) (← links)
