scientific article; zbMATH DE number 478394
From MaRDI portal
Publication:4273952
autoepistemic logicdefault logicdefault reasoningdefault theoriesKripke modellogic programmingmodal logicsmodal nonmonotonic logicsnonmonotonic logicsnonmonotonic reasoningpropositional proof systems
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logic in computer science (03B70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17) Logic in artificial intelligence (68T27)
Recommendations
Cited in
(only showing first 100 items - show all)- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
- Default logic generalized and simplified
- On the relation among answer set solvers
- A non-preferential semantics of non-monotonic modal logic
- Hyperequivalence of logic programs with respect to supported models
- Nonclassical logics and information processing. International Workshop, Berlin, Germany, November 9--10, 1990. Proceedings
- On the relation between default and modal nonmonotonic reasoning
- Prolog technology for default reasoning: proof theory and compilation techniques
- Recovery of (non)monotonic theories
- Lexicographic priorities in default logic
- Is default logic a reinvention of inductive-statistical reasoning?
- Logic programs, well-orderings, and forward chaining
- A context for belief revision: forward chaining-normal nonmonotonic rule systems
- Querying disjunctive databases through nonmonotonic logics
- Seminormal stratified default theories
- Revision programming
- Abduction from logic programs: Semantics and complexity
- Multi-interpretation operators and approximate classification.
- Definability and commonsense reasoning
- Semantics and complexity of abduction from default theories
- Abductive reasoning through filtering
- Expressing preferences in default logic
- Alternative foundations for Reiter's default logic
- Default reasoning from conditional knowledge bases: Complexity and tractable cases
- Logic programming and knowledge representation---The A-Prolog perspective
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- On the computational complexity of assumption-based argumentation for default reasoning.
- Propositional default logics made easier: computational complexity of model checking.
- Uniform semantic treatment of default and autoepistemic logics
- More on representation theory for default logic
- The complexity of predicate default logic over a countable domain
- Default reasoning by deductive planning
- Complexity of computing with extended propositional logic programs
- On the decidability and complexity of reasoning about only knowing
- Autoepistemic answer set programming
- Redundancy in logic. III: Non-monotonic reasoning
- Defaults with priorities
- Multi-modal nonmonotonic logics of minimal knowledge
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- Strong Backdoors for Default Logic
- Privacy preservation using multi-context systems and default logic
- Relating truth, knowledge and belief in epistemic states
- Some Rough Consequence Logics and their Interrelations
- Automata and Answer Set Programming
- The Complexity of Reasoning for Fragments of Default Logic
- Combining nonmonotonic knowledge bases with external sources
- A survey of non-monotonic reasoning
- scientific article; zbMATH DE number 41270 (Why is no real title available?)
- scientific article; zbMATH DE number 140404 (Why is no real title available?)
- scientific article; zbMATH DE number 1218288 (Why is no real title available?)
- Modal nonmonotonic logics
- scientific article; zbMATH DE number 517028 (Why is no real title available?)
- Nonmonotonic default modal logics
- scientific article; zbMATH DE number 1749200 (Why is no real title available?)
- scientific article; zbMATH DE number 1754692 (Why is no real title available?)
- Algebraic semantics for modal and superintuitionistic non-monotonic logics
- Knowledge means ‘all’, belief means ‘most’
- Random logic programs: linear model
- A sequent calculus for skeptical Default Logic
- Specification of nonmonotonic reasoning
- Nonmonotonic reasoning with multiple belief sets
- scientific article; zbMATH DE number 194618 (Why is no real title available?)
- An introduction to default logic
- On the parameterized complexity of non-monotonic logics
- A unifying approach for nonmonotonic S4F, (reflexive) autoepistemic logic, and answer set programming
- A sphere world semantics for default reasoning
- Skeptical rational extensions
- Reasoning with stratified default theories
- Trans-epistemic semantics for logic programs
- A logic framework for P2P deductive databases
- Cumulativity Tailored for Nonmonotonic Reasoning
- A uniform tableaux method for nonmonotonic modal logics
- Semi-representability of default theories in rational default logic
- Infinitary default logic for specification of nonmonotonic reasoning
- Revising and updating using a back-up semantics
- Quo Vadis Answer Set Programming?
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Approximation Schemes in Logic and Artificial Intelligence
- scientific article; zbMATH DE number 2239772 (Why is no real title available?)
- Default logic and bounded treewidth
- More on bounding introspection in modal nonmonotonic logics
- Symbolic knowledge extraction from trained neural networks: A sound approach
- Nonmonotonic reasoning by inhibition nets
- An argument-based approach to reasoning with specificity
- Artificial nonmonotonic neural networks
- Constraints on extensions of a default theory
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Thirty years of Epistemic Specifications
- Proof complexity of propositional default logic
- Strong backdoors for default logic
- Strong backdoors for default logic
- A new logical characterisation of stable models and answer sets
- Nonmonotonic reasoning by monotonic inferences with priority constraints
- Graph theoretical structures in logic programs and default theories
- Annotated nonmonotonic rule systems
- Hypersequent calculi for propositional default logics
- Believing in default rules: inclusive default reasoning
- The finite frame property of some extensions of the pure logic of necessitation
- Stable reasoning, ASP and the interrogative model of inquiry
- Evaluating the effect of semi-normality on the expressiveness of defaults
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4273952)