Circumscription - a form of non-monotonic reasoning
From MaRDI portal
(Redirected from Publication:1140440)
Cites work
Cited in
(only showing first 100 items - show all)- The Complexity of Reasoning for Fragments of Default Logic
- Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs
- A first-order conditional logic for prototypical properties
- Results on translating defaults to circumscription
- Exhaustive interpretation of complex sentences
- Semantic characterization of rational closure: from propositional logic to description logics
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- The complexity of minimal satisfiability problems
- Circumscriptive theories: A logic-based framework for knowledge representation
- Circumscription: Completeness reviewed
- Efficient reasoning about rich temporal domains
- A sound and complete proof theory for the generalized logic of only knowing
- Sequent calculi for choice logics
- Autoepistemic logic of knowledge and beliefs
- Defaults in domain theory
- Causality as a key to the frame problem
- Remedial interchange, contrary-to-duty obligation and commutation
- Free choice reasons
- Modal logic for default reasoning
- Semantic interpolation
- Nonmonotonicity and the scope of reasoning
- Abduction from logic programs: Semantics and complexity
- Reducing belief revision to circumscription (and vice versa)
- A note on the stable model semantics for logic programs
- General logical databases and programs: Default logic semantics and stratification
- On rational entailment for propositional typicality logic
- How does a box work? A study in the qualitative dynamics of solid objects
- Semantics and complexity of recursive aggregates in answer set programming
- Three-valued nonmonotonic formalisms and semantics of logic programs
- Dispositional logic
- Two simple characterizations of well-founded semantics
- Stable Models for Temporal Theories
- Permissive planning: Extending classical planning to uncertain task domains.
- Sound and efficient closed-world reasoning for planning
- Compiling specificity into approaches to nonmonotonic reasoning
- A generalized view of nonmonotonic knowledge: a set of theoretic perspective
- Safe Formulas in the General Theory of Stable Models (Preliminary Report)
- Note about cardinality-based circumscription
- The place of logic in reasoning
- Program Correspondence under the Answer-Set Semantics: The Non-ground Case
- Outlier detection using default reasoning
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- The complexity of circumscriptive inference in Post's lattice
- Trichotomies in the complexity of minimal inference
- My work with Victor Marek: a mathematician looks at answer set programming
- Theorem proving techniques for view deletion in databases
- LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES
- Strong backdoors for default logic
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- Some representational issues in default reasoning
- A theory of nonmonotonic rule systems I
- Foundations of everyday practical reasoning
- Strong Backdoors for Default Logic
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Simulation refinement for concurrency verification
- \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem
- From systems to logic in the early development of nonmonotonic reasoning
- John McCarthy's legacy
- McCarthy variations in a modal key
- A generalization of collapsible cases of circumscription
- Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints
- Reasoning with infinite stable models
- Lifschitz and Circumscription
- To Vladimir Lifschitz on His 65th Birthday
- On first-order conditional logics
- A natural semantics for modal logic over databases
- The anomalous extension problem in default reasoning
- Expert system models for inference with imperfect knowledge: A comparative study
- Twelve Definitions of a Stable Model
- Is there an alternative to parsimonious semantics?
- Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation
- Inductive equivalence in clausal logic and nonmonotonic logic programming
- Second-order reasoning in description logics
- On the number of minimal transversals in 3-uniform hypergraphs
- Embedding circumscriptive theories in general disjunctive programs
- Implicit and explicit stances in logic
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
- Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Inductive learning and defeasible inference
- scientific article; zbMATH DE number 7450027 (Why is no real title available?)
- Elaboration tolerance through object-orientation
- An incremental algorithm for generating all minimal models
- Monadic second-order model-checking on decomposable matroids
- Semantical and computational aspects of Horn approximations
- On decision-theoretic foundations for defaults
- Formalizing incomplete knowledge in incomplete databases
- The importance of open and recursive circumscription
- Partial Functions and Equality in Answer Set Programming
- Nonmonotonic reasoning, preferential models and cumulative logics
- Sequent calculi for choice logics
- Projection and scope-determined circumscription
- Dynamic reasoning systems
- On the equivalence of the static and disjunctive well-founded semantics and its computation
- A generalization of the Lin-Zhao theorem
- Minimal predicates, fixed-points, and definability
- The complexity of belief update
- From environments to representations -- a mathematical theory of artificial perceptions
- The expressive power of circumscription
This page was built for publication: Circumscription - a form of non-monotonic reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140440)
