Pages that link to "Item:Q1140440"
From MaRDI portal
The following pages link to Circumscription - a form of non-monotonic reasoning (Q1140440):
Displaying 50 items.
- Preferences in artificial intelligence (Q314443) (← links)
- The logic of empirical theories revisited (Q383008) (← links)
- Inductive equivalence in clausal logic and nonmonotonic logic programming (Q413854) (← links)
- Projection and scope-determined circumscription (Q429594) (← links)
- Abnormality and randomness (Q432964) (← links)
- Defeasible conditionalization (Q484106) (← links)
- On the tractability of minimal model computation for some CNF theories (Q490649) (← links)
- On the parameterized complexity of non-monotonic logics (Q494658) (← links)
- Simulation refinement for concurrency verification (Q541209) (← links)
- John McCarthy's legacy (Q543573) (← links)
- \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem (Q543579) (← links)
- A unifying action calculus (Q543584) (← links)
- Iterated belief change in the situation calculus (Q543588) (← links)
- Stable models and circumscription (Q543596) (← 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)
- Formalising the Fisherman's Folly puzzle (Q543602) (← links)
- From systems to logic in the early development of nonmonotonic reasoning (Q543606) (← links)
- McCarthy variations in a modal key (Q543607) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- A theorem on the consistency of circumscription (Q578934) (← links)
- Using approximate reasoning to represent default knowledge (Q578935) (← links)
- Decidability and definability with circumscription (Q579240) (← links)
- Brain-like computing based on distributed representations and neurodynamics (Q609752) (← links)
- On-line algorithms for satisfiability problems with uncertainty (Q673379) (← links)
- Graded hypothesis theories (Q673394) (← links)
- Knowledgebase transformations (Q676426) (← links)
- Circumscription: Completeness reviewed (Q685339) (← links)
- Recursively indefinite databases (Q688672) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- The semantics of incomplete databases as an expression of preferences (Q753482) (← links)
- Foundations of a functional approach to knowledge representation (Q799390) (← links)
- Plausible inferences and plausible reasoning (Q805605) (← links)
- Evaluating the effect of semi-normality on the expressiveness of defaults (Q814438) (← links)
- Reconstructing force-dynamic models from video sequences (Q814526) (← links)
- Nonmonotonic causal theories (Q814551) (← links)
- Elaboration tolerance through object-orientation (Q814560) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- Qualitative choice logic (Q814609) (← links)
- Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs (Q819946) (← links)
- The hypothetical syllogism (Q839650) (← links)
- A generalization of the Lin-Zhao theorem (Q854963) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- A preferential semantics for causal reasoning about action (Q862556) (← links)
- Semantic characterization of rational closure: from propositional logic to description logics (Q898736) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- On the associations between variables in expert systems including default relations (Q908716) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
