Clausal logic and logic programming in algebraic domains
From MaRDI portal
Publication:1854478
DOI10.1006/inco.2001.3073zbMath1005.68094OpenAlexW2022476135MaRDI QIDQ1854478
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/547711c938458390589d182a29522b26aefdd603
Related Items (14)
Reasoning with power defaults ⋮ Fuzzy logic programming via multilattices ⋮ On the order-theoretic properties of lower concept formula systems ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Generalized metrics and uniquely determined logic programs. ⋮ A logic for Lawson compact algebraic L-domains ⋮ Finitary coalgebraic multisemilattices and multilattices. ⋮ Transformations of discrete closure systems ⋮ Unnamed Item ⋮ Continuous L-domains in logical form ⋮ Cut elimination for entailment relations ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Bounded complete domains and their logical form ⋮ A categorical representation of algebraic domains based on variations of rough approximable concepts
Cites Work
- A logic for default reasoning
- Domain theory in logical form
- Inheritance comes of age: applying nonmonotonic techniques to problems in industry
- Defaults in domain theory
- Reasoning with power defaults
- A Direct Proof of the Hofmann-Mislove Theorem
- Logic programming and knowledge representation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clausal logic and logic programming in algebraic domains