Circumscription - a form of non-monotonic reasoning
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Modeling generalized implicatures using non-monotonic logics
- My work with Victor Marek: a mathematician looks at answer set programming
- Inductive situation calculus
- A computational approach to fuzzy quantifiers in natural languages
- Some representational issues in default reasoning
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Automated inferencing
- On the satisfiability of circumscription
- Completeness results for circumscription
- Foundation of logic programming based on inductive definition
- Closed-world databases and circumscription
- Variable precision logic
- Dispositional logic
- On the computability of circumscription
- A natural semantics for modal logic over databases
- Reasoning about action. I: A possible worlds approach
- Reasoning about action. II: The qualification problem
- An approach to default reasoning based on a first-order conditional logic: Revised report
- On the relation between default and autoepistemic logic
- The anomalous extension problem in default reasoning
- Autocircumscription
- A first-order conditional logic for prototypical properties
- Nonmonotonic logic and temporal projection
- Expert system models for inference with imperfect knowledge: A comparative study
- Efficient reasoning about rich temporal domains
- On the relationship between circumscription and negation as failure
- An algorithm to compute circumscription
- A generalization of collapsible cases of circumscription
- The importance of open and recursive circumscription
- Results on translating defaults to circumscription
- Eliminating the fixed predicates from a circumscription
- Minimalism, justification and non-monotonicity in deductive databases
- A circumscriptive theorem prover
- Reasoning with minimal models: efficient algorithms and applications
- A note on the stable model semantics for logic programs
- Circumscribing DATALOG: expressive power and complexity
- Tableau systems for paraconsistency and minimal inconsistency
- Between constructive mathematics and PROLOG
- General logical databases and programs: Default logic semantics and stratification
- Nonmonotonic reasoning, preferential models and cumulative logics
- Nonmonotonic reasoning in the framework of situation calculus
- Impediments to universal preference-based default theories
- Three-valued nonmonotonic formalisms and semantics of logic programs
- The theory of nomic probability
- Nonmonotonicity and the scope of reasoning
- Abstract minimality and circumscription
- An efficient method for eliminating varying predicates from a circumscription
- What does a conditional knowledge base entail?
- Resolving ambiguity in nonmonotonic inheritance hierarchies
- An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Linear resolution for consequence finding
- On the complexity of propositional knowledge base revision, updates, and counterfactuals
- A logic of knowledge and justified assumption
- The complexity of model checking for circumscriptive formulae
- Miracles in formal theories of action
- The value of the four values
- On first-order conditional logics
- The expressive power of circumscription
- Inheritance comes of age: applying nonmonotonic techniques to problems in industry
- From environments to representations -- a mathematical theory of artificial perceptions
- Lexicographic priorities in default logic
- A general scheme for formalizing defaults using the predicate \(ab(I,S)\)
- Non-monotonic fuzzy reasoning
- Is default logic a reinvention of inductive-statistical reasoning?
- To preference via entrenchment
- The open logic and its relation to circumscription
- Autoepistemic circumscription and logic programming
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment
- SET-VAR
- Translations of network languages
- The complexity of propositional closed world reasoning and circumscription
- Justification and defeat
- Conditional logics of normality: A modal approach
- Formalizing incomplete knowledge in incomplete databases
- Motivated action theory: A formal theory of causal reasoning
- Possible world semantics and autoepistemic reasoning
- A tableau prover for domain minimization
- Tableau-based characterization and theorem proving for default logic
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Issues in commonsense set theory
- Deontic logic as founded on nonmonotonic logic
- Counterfactual reasoning by (means of) defaults
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- A theory of nonmonotonic rule systems I
- Modal logic for default reasoning
- The inheritance of dynamic and deontic integrity constraints or: Does the boss have more rights?
- Circumscriptive semantics for updating knowledge bases
- Network languages for intelligent control
- Network languages for concurrent multiagent systems
- On computing minimal models
- The complexity of minimum partial truth assignments and implication in negation-free formulae
- Autoepistemic logic of knowledge and beliefs
- Abduction from logic programs: Semantics and complexity
- On compact representations of propositional circumscription
- Defaults in domain theory
- Causality as a key to the frame problem
- Sound and efficient closed-world reasoning for planning
- Permissive planning: Extending classical planning to uncertain task domains.
- Ramification and causality
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)
