The following pages link to A logic for default reasoning (Q1140434):
Displaying 50 items.
- Making the right exceptions (Q309916) (← links)
- Preferences in artificial intelligence (Q314443) (← links)
- Adaptive logic characterizations of input/output logic (Q332074) (← links)
- Abductive inference methods in problems of job planning in complex objects (Q357155) (← links)
- Inconsistency measures for probabilistic logics (Q360045) (← links)
- Completing causal networks by meta-level abduction (Q374193) (← links)
- When adjunction fails (Q382989) (← links)
- Abnormality and randomness (Q432964) (← links)
- Sum-based weighted belief base merging: from commensurable to incommensurable framework (Q465608) (← links)
- A logical calculus for controlled monotonicity (Q472804) (← links)
- Restricted default theories: expressive power and outlier detection tasks (Q483301) (← links)
- Defeasible conditionalization (Q484106) (← links)
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- From description-logic programs to multi-context systems (Q516031) (← links)
- Monotonic and non-monotonic embeddings of Anselm's proof (Q523299) (← links)
- Assessing the epistemological relevance of Dung-style argumentation theories (Q524939) (← links)
- John McCarthy's legacy (Q543573) (← links)
- Stable models and circumscription (Q543596) (← links)
- From answer set logic programming to circumscription via logic of GK (Q543597) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- How does a box work? A study in the qualitative dynamics of solid objects (Q543601) (← links)
- From systems to logic in the early development of nonmonotonic reasoning (Q543606) (← links)
- A deontic logic framework allowing for factual detachment (Q545154) (← links)
- Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
- Using approximate reasoning to represent default knowledge (Q578935) (← links)
- Querying logical databases (Q579967) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Brain-like computing based on distributed representations and neurodynamics (Q609752) (← links)
- Permission to speak: a logic for access control and conformance (Q615900) (← links)
- Outlier detection for simple default theories (Q622112) (← links)
- Defeasible inheritance with doubt index and its axiomatic characterization (Q622128) (← links)
- Well-founded semantics for defeasible logic (Q625708) (← links)
- Proof complexity of propositional default logic (Q647339) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- On-line algorithms for satisfiability problems with uncertainty (Q673379) (← links)
- Multi-valued logic programming semantics An algebraic approach (Q673383) (← links)
- Annotated nonmonotonic rule systems (Q673384) (← links)
- Graded hypothesis theories (Q673394) (← links)
- On the autoepistemic reconstruction of logic programming (Q685123) (← links)
- On prediction in Theorist (Q685340) (← links)
- A reasoning method for a paraconsistent logic (Q687160) (← links)
- A logic for reasoning with inconsistency (Q688558) (← links)
- Incorporating top-down information into bottom-up hypothetical reasoning (Q688821) (← links)
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- Applause: An implementation of the Collins-Michalski theory of plausible reasoning (Q751307) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Negation by default and unstratifiable logic programs (Q753501) (← links)
