Autoepistemic logic
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Exploiting conjunctive queries in description logic programs
- Stable and extension class theory for logic programs and default logics
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- A logic of knowledge and justified assumption
- Operational concepts of nonmonotonic logics. II: Autoepistemic logic
- On the relation between default and modal nonmonotonic reasoning
- Expressive power and complexity of partial models for disjunctive deductive databases
- Logic programs, well-orderings, and forward chaining
- Autoepistemic circumscription and logic programming
- A context for belief revision: forward chaining-normal nonmonotonic rule systems
- Possible world semantics and autoepistemic reasoning
- Autoepistemic logic of first order and its expressive power
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Multiple total stable models are definitely needed to solve unique solution problems
- Querying disjunctive databases through nonmonotonic logics
- Formalizing a logic for logic programming
- The expressive powers of stable models for bound and unbound DATALOG queries
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Multi-valued autoepistemic logic
- Seminormal stratified default theories
- Polynomial-time computable stable models
- Revision programming
- Abduction from logic programs: Semantics and complexity
- On compact representations of propositional circumscription
- Logic programming and knowledge representation---The A-Prolog perspective
- Safe inductions and their applications in knowledge representation
- Answer set programming in intuitionistic logic
- Fixpoint semantics for active integrity constraints
- Propositional default logics made easier: computational complexity of model checking.
- Complexity and expressive power of deterministic semantics for DATALOG^ .
- Functional queries in datalog
- A decision method for nonmonotonic reasoning based on autoepistemic reasoning
- 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
- \(\mathit{Log}_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions
- Disjunctive logic programs, answer sets, and the cut rule
- All I know: A study in autoepistemic logic
- Backdoors to tractable answer set programming
- Semantic forgetting in answer set programming
- A monotonic view on reflexive autoepistemic reasoning
- Complexity results for answer set programming with bounded predicate arities and implications
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Translating multi-agent autoepistemic logic into logic program
- Evaluating epistemic negation in answer set programming
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Active integrity constraints and revision programming
- Oscillating behavior of logic programs
- The complexity of reasoning for fragments of autoepistemic logic
- Fuzzy autoepistemic logic: reflecting about knowledge of truth degrees
- Data repair of inconsistent nonmonotonic description logic programs
- Provided you're not trivial: adding defaults and paraconsistency to a formal model of explanation
- scientific article; zbMATH DE number 4206035 (Why is no real title available?)
- A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
- An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
- Answer Set Programming: A Primer
- Some (in)translatability results for normal logic programs and propositional theories
- scientific article; zbMATH DE number 4075021 (Why is no real title available?)
- scientific article; zbMATH DE number 4101147 (Why is no real title available?)
- scientific article; zbMATH DE number 4104923 (Why is no real title available?)
- scientific article; zbMATH DE number 4104925 (Why is no real title available?)
- scientific article; zbMATH DE number 22186 (Why is no real title available?)
- scientific article; zbMATH DE number 33417 (Why is no real title available?)
- scientific article; zbMATH DE number 35416 (Why is no real title available?)
- scientific article; zbMATH DE number 35426 (Why is no real title available?)
- scientific article; zbMATH DE number 39879 (Why is no real title available?)
- scientific article; zbMATH DE number 60835 (Why is no real title available?)
- scientific article; zbMATH DE number 67824 (Why is no real title available?)
- scientific article; zbMATH DE number 97788 (Why is no real title available?)
- scientific article; zbMATH DE number 149516 (Why is no real title available?)
- scientific article; zbMATH DE number 500200 (Why is no real title available?)
- scientific article; zbMATH DE number 512987 (Why is no real title available?)
- scientific article; zbMATH DE number 512988 (Why is no real title available?)
- scientific article; zbMATH DE number 549992 (Why is no real title available?)
- scientific article; zbMATH DE number 549998 (Why is no real title available?)
- On the impact of stratification on the complexity of nonmonotonic reasoning
- Nonmonotonic reasoning based on incomplete logic
- Embedding prioritized circumscription in disjunctive logic programs
- A sound and complete proof theory for the generalized logic of only knowing
- scientific article; zbMATH DE number 1761406 (Why is no real title available?)
- scientific article; zbMATH DE number 1761412 (Why is no real title available?)
- First-order Answer Set Programming as Constructive Proof Search
- The expressive power of unique total stable model semantics
- Characterizing and extending answer set semantics using possibility theory
- Random logic programs: linear model
- Query answering in resource-based answer set semantics
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Talkin'bout consistency, or: When logically possible becomes possible
- Contextual hypotheses and semantics of logic programs
- A unifying approach for nonmonotonic S4F, (reflexive) autoepistemic logic, and answer set programming
- A unified algebraic framework for non-monotonicity
- A Logical Autobiography
- Complexity results for abductive logic programming
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)
