Autoepistemic logic

DOI10.1145/116825.116836zbMATH Open0799.68176OpenAlexW2611415697MaRDI QIDQ4302848

Wiktor Marek, Mirosław Truszczyński

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

zbMATH Keywords

stratificationbelief revisionexpansionnonmonotonic reasoningNP-completenesslogic programmingautoepistemic logicmechanical theorem proving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic programming (68N17) Logic in artificial intelligence (68T27)

Cited In (97)

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

This page was built for publication: Autoepistemic logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302848)