Circumscription - a form of non-monotonic reasoning

Cites Work

A logic for default reasoning
The mathematics of non-monotonic reasoning
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

Sequent calculi for choice logics
Semantic interpolation
Free choice reasons
On rational entailment for propositional typicality logic
Strong backdoors for default logic
Model enumeration in propositional circumscription via unsatisfiable core analysis
Theorem proving techniques for view deletion in databases
Logic and Complexity in Cognitive Science
Strong Backdoors for Default Logic
Is there an alternative to parsimonious semantics?
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
Inductive learning and defeasible inference
Implicit and explicit stances in logic
Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base
On decision-theoretic foundations for defaults
Sequent calculi for choice logics
Algebraic semantics for modal and superintuitionistic non-monotonic logics
Modality and interrupts
A note on a description logic of concept and role typicality for defeasible reasoning over ontologies
Enhancing context knowledge repositories with justifiable exceptions
A tableau calculus for minimal modal model generation
Artificial intelligence and language
Knowledge representation: modalities, conditionals, and nonmonotonic reasoning
Logic programming
\(Log_A\mathbf{G}\): an algebraic non-monotonic logic for reasoning with graded propositions
Branching vs. Linear Time: Semantical Perspective
Strong backdoors for default logic
Argument strength in probabilistic argumentation using confirmation theory
Representation results for non-cumulative logics
The inverse satisfiability problem
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
The complexity of predicate default logic over a countable domain
Prima facie and seeming duties
Annotation theories over finite graphs
Circumscription within monotonic inferences
Local logics, non-monotonicity and defeasible argumentation
Nonmonotonic reasoning by monotonic inferences with priority constraints
ECWA made easy
Well-founded and stationary models of logic programs
Sequent-type rejection systems for finite-valued non-deterministic logics
A logic for inductive probabilistic reasoning
Information tradeoffs in model building: A network routing application
Title not available (Why is that?)
A graded approach to database repair by context-aware distance semantics
Integrity constraints in OWL ontologies based on grounded circumscription
Dynamics of inductive inference in a unified framework
Gelfond-Zhang aggregates as propositional formulas
EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface
Reasoning with different levels of uncertainty
A dissimilarity-based framework for generating inconsistency-tolerant logics
On-line algorithms for satisfiability problems with uncertainty
Combining UML and ontology: an exploratory survey
Synthesis of compact strategies for coordination programs
Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming
Graph-based construction of minimal models
A first-order conditional logic for prototypical properties
Results on translating defaults to circumscription
Remedial interchange, contrary-to-duty obligation and commutation
Circumscription: Completeness reviewed
Modal logic for default 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
Three-valued nonmonotonic formalisms and semantics of logic programs
Note about cardinality-based circumscription
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
Disjunctive \(LP+\) integrity constraints = stable model semantics.
Twelve Definitions of a Stable Model
A theory of nonmonotonic rule systems I
Some representational issues in default reasoning
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
Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation
Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
Elaboration tolerance through object-orientation
On the equivalence of the static and disjunctive well-founded semantics and its computation
On compact representations of propositional circumscription
Semantics for a theory of defeasible reasoning
Deontic logic as founded on nonmonotonic logic
Ramification and causality
Decidability and definability with circumscription
Using approximate reasoning to represent default knowledge
Contextual reasoning distilled
The qualification problem: A solution to the problem of anomalous models
Counterfactuals
A GENERALIZED VIEW OF NONMONOTONIC KNOWLEDGE: A SET OF THEORETIC PERSPECTIVE
A circumscriptive calculus of events
Completeness results for circumscription
On the satisfiability of circumscription
Brain-like computing based on distributed representations and neurodynamics
Justification and defeat
On the computability of circumscription
Complexity and undecidability results for logic programming

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)