Equilibrium logic
From MaRDI portal
Publication:854969
DOI10.1007/S10472-006-9028-ZzbMATH Open1117.03039OpenAlexW2914398864MaRDI QIDQ854969FDOQ854969
Authors: N. E. Zubov 
Publication date: 20 December 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-006-9028-z
Recommendations
Logic programming (68N17) Logic in artificial intelligence (68T27) Intermediate logics (03B55) Logic in computer science (03B70)
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Nonmonotonic reasoning, preferential models and cumulative logics
- Extending and implementing the stable model semantics
- Resolution for quantified Boolean formulas
- On the computational cost of disjunctive logic programming: Propositional case
- Nested expressions in logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Weight constraints as nested expressions
- Strong equivalence made easy: nested expressions and weight constraints
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- The DLV system for knowledge representation and reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
- Constructible falsity
- Satisfiability in many-valued sentential logic is NP-complete
- Logic programming and reasoning with incomplete information
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on \(\eta\)-lattices and constructive logic with strong negation
- Logic Programming
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Title not available (Why is that?)
- Reasoning about effects of concurrent actions
- Characterization of strongly equivalent logic programs in intermediate logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- A first order nonmonotonic extension of constructive logic
- Logics in Artificial Intelligence
- Clausal intuitionistic logic I. fixed-point semantics
- Combining negation as failure and embedded implications in logic programs
- A logical analysis of modules in logic programming
- Intuitionistic logic with strong negation
- On extensions of intermediate logics by strong negation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
- Title not available (Why is that?)
- From here to there: Stable negation in logic programming
- Title not available (Why is that?)
- Logic Programming
- Safe beliefs for propositional theories
- Using clausal deductive databases for defining semantics in disjunctive deductive databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Logic and Computation of Partial Equilibrium Models
- Stable inference as intuitionistic validity
- Title not available (Why is that?)
- Logics in Artificial Intelligence
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
- Title not available (Why is that?)
Cited In (68)
- Temporal equilibrium logic: a survey
- Temporal Here and There
- Semi-equilibrium models for paracoherent answer set programs
- Interpolable formulas in equilibrium logic and answer set programming
- Title not available (Why is that?)
- Model-based recasting in answer-set programming
- Quantified Equilibrium Logic and Foundations for Answer Set Programs
- Parametrized equilibrium logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Default Negation as Explicit Negation plus Update
- Equivalence of defeasible normative systems
- Causal Logic Programming
- To Vladimir Lifschitz on His 65th Birthday
- The infinite-valued semantics: overview, recent results and future directions
- Answer Set Programming: A Primer
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Synonymous theories and knowledge representations in answer set programming
- Evaluating epistemic negation in answer set programming
- From answer set logic programming to circumscription via logic of GK
- LARS: a logic-based framework for analytic reasoning over streams
- Algebraic semantics for modal and superintuitionistic non-monotonic logics
- A first order nonmonotonic extension of constructive logic
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Paracoherent answer set computation
- Causal Graph Justifications of Logic Programs
- Three-Valued Logics for Incomplete Information and Epistemic Logic
- Contextual hypotheses and semantics of logic programs
- First-order Answer Set Programming as Constructive Proof Search
- A modal theorem-preserving translation of a class of three-valued logics of incomplete information
- Deriving conclusions from non-monotonic cause-effect relations
- A denotational semantics for equilibrium logic
- Cumulativity Tailored for Nonmonotonic Reasoning
- Temporal logic programs with variables
- selp: A Single-Shot Epistemic Logic Program Solver
- Partial equilibrium logic
- Editorial: Weighted logics for artificial intelligence -- an introductory discussion
- Contingency-based equilibrium logic
- Logic programming as classical inference
- Autoepistemic answer set programming
- Autoepistemic equilibrium logic and epistemic specifications
- Forgetting auxiliary atoms in forks
- Logic Programming and Nonmonotonic Reasoning
- A map of dependencies among three-valued logics
- Modular Paracoherent Answer Sets
- Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty
- Well-Founded and Partial Stable Semantics Logical Aspects
- Logics in Artificial Intelligence
- FLP answer set semantics without circular justifications for general logic programs
- Logics in Artificial Intelligence
- Answer set programming in intuitionistic logic
- Determining inference semantics for disjunctive logic programs
- Gelfond-Zhang aggregates as propositional formulas
- Stability, Supportedness, Minimality and Kleene Answer Set Programs
- Better Paracoherent Answer Sets with Less Resources
- On the Expressiveness of Temporal Equilibrium Logic
- Here and there among logics for logic programming
- Applying visible strong equivalence in answer-set program transformations
- Stable reasoning
- An infinitary encoding of temporal equilibrium logic
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Abstraction for non-ground answer set programs
- A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming
- Answer set programming made easy
- Title not available (Why is that?)
- Refining the semantics of epistemic specifications
- Gödel-Dummett linear temporal logic
- Justifications for programs with disjunctive and causal-choice rules
Uses Software
This page was built for publication: Equilibrium logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854969)
