Embedding Logics in the Local Computation Framework
From MaRDI portal
Recommendations
Cites work
- A circumscriptive theorem prover
- An algorithm to compute circumscription
- An approach to default reasoning based on a first-order conditional logic: Revised report
- Bucket elimination: A unifying framework for reasoning
- Consistency in Valuation-Based Systems
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- Linear resolution for consequence finding
- Nonmonotonic Logic II
- On the relationship between circumscription and negation as failure
- On the relationship between CWA, minimal model, and minimal herbrand model semantics
- Probability propagation
- Propositional information systems
- Semantical considerations on nonmonotonic logic
Cited in
(7)- LoCo—A Logic for Configuration Problems
- Optimizing epistemic model checking using conditional independence (extended abstract)
- scientific article; zbMATH DE number 1341465 (Why is no real title available?)
- scientific article; zbMATH DE number 522843 (Why is no real title available?)
- Local computation in linear logic
- scientific article; zbMATH DE number 1453054 (Why is no real title available?)
- Hybrid possibilistic networks
This page was built for publication: Embedding Logics in the Local Computation Framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443007)