Autoepistemic logic
From MaRDI portal
Publication:4302848
DOI10.1145/116825.116836zbMath0799.68176OpenAlexW2611415697MaRDI QIDQ4302848
Victor W. Marek, Miroslaw Truszczynski
Publication date: 21 August 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/116825.116836
stratificationexpansionbelief revisionNP-completenessautoepistemic logicnonmonotonic reasoninglogic programmingmechanical theorem proving
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Logic programming (68N17)
Related Items
A context for belief revision: forward chaining-normal nonmonotonic rule systems, A Model for Phase Transition of Random Answer-Set Programs, On Well-Founded Set-Inductions and Locally Monotone Operators, Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs, Active integrity constraints and revision programming, Evaluating epistemic negation in answer set programming, Oscillating Behavior of Logic Programs, Possible world semantics and autoepistemic reasoning, An alternative approach to the semantics of disjunctive logic programs and deductive databases, A decision method for nonmonotonic reasoning based on autoepistemic reasoning, Multiple total stable models are definitely needed to solve unique solution problems, Querying disjunctive databases through nonmonotonic logics, Formalizing a logic for logic programming, Data repair of inconsistent nonmonotonic description logic programs, Safe inductions and their applications in knowledge representation, Strong order equivalence, Possibilistic uncertainty handling for answer set programming, Semantic forgetting in answer set programming, The expressive powers of stable models for bound and unbound DATALOG queries, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, First-order Answer Set Programming as Constructive Proof Search, Ultimate approximation and its application in nonmonotonic knowledge representation systems, The expressive power of unique total stable model semantics, Seminormal stratified default theories, Polynomial-time computable stable models, A nondeterministic well-founded semantics, Well-founded and stationary models of logic programs, Preference logics: Towards a unified approach to nonmonotonicity in deductive reasoning, Complexity and undecidability results for logic programming, On the computational cost of disjunctive logic programming: Propositional case, Complexity of computing with extended propositional logic programs, Propositional semantics for disjunctive logic programs, Modal nonmonotonic logics demodalized, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, Revision programming, Abduction from logic programs: Semantics and complexity, On compact representations of propositional circumscription, Complexity results for abductive logic programming, Computing the well-founded semantics faster, Reasoning with stratified default theories, Stable classes and operator pairs for disjunctive programs, On the impact of stratification on the complexity of nonmonotonic reasoning, Solution Enumeration by Optimality in Answer Set Programming, Answer set programming in intuitionistic logic, Characterizing and extending answer set semantics using possibility theory, Random logic programs: Linear model, Query answering in resource-based answer set semantics, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Fixpoint semantics for active integrity constraints, Logic programming as classical inference, Complexity results for answer set programming with bounded predicate arities and implications, A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption, Unnamed Item, Guarantees and limits of preprocessing in constraint satisfaction and reasoning, Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs, Talkin'bout consistency, or: When logically possible becomes possible, atalog: A logic language for expressing search and optimization problems, Contextual hypotheses and semantics of logic programs, Provided You’re not Trivial: Adding Defaults and Paraconsistency to a Formal Model of Explanation, Graph theoretical structures in logic programs and default theories, Graded hypothesis theories, Fuzzy Autoepistemic Logic: Reflecting about Knowledge of Truth Degrees, Nonmonotonic reasoning based on incomplete logic, Stable and extension class theory for logic programs and default logics, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, The alternating fixpoint of logic programs with negation, Semantics and complexity of recursive aggregates in answer set programming, Ordering default theories and nonmonotonic logic programs, General default logic, Embedding prioritized circumscription in disjunctive logic programs, A sound and complete proof theory for the generalized logic of only knowing, \(Log_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions, Negation in rule-based database languages: A survey, An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems, Answer Set Programming: A Primer, On the relation between default and modal nonmonotonic reasoning, Expressive power and complexity of partial models for disjunctive deductive databases, Exploiting conjunctive queries in description logic programs, Some (in)translatability results for normal logic programs and propositional theories, Logic programs, well-orderings, and forward chaining, Disjunctive logic programs, answer sets, and the cut rule, Declarative Semantics for Active Integrity Constraints, Propositional default logics made easier: computational complexity of model checking., Backdoors to tractable answer set programming, Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\)., Functional queries in datalog, Logic programming and knowledge representation---The A-Prolog perspective
