Clausal Logic and Logic Programming in Algebraic Domains

@article{Rounds2001ClausalLA,
  title={Clausal Logic and Logic Programming in Algebraic Domains},
  author={William C. Rounds and Guo-Qiang Zhang},
  journal={Inf. Comput.},
  year={2001},
  volume={171},
  pages={183-200}
}
We introduce a domain-theoretic foundation for disjunctive logic programming. This foundation is built on clausal logic, a representation of the Smyth powerdomain of any coherent algebraic dcpo. We establish the completeness of a resolution rule for inference in such a clausal logic; we introduce a natural declarative semantics and a fixed-point semantics for disjunctive logic programs, and prove their equivalence; finally, we apply our results to give both a syntax and semantics for default… 
Domain-theoretic Semantics for Disjunctive Logic Programs
TLDR
This paper proposes a resolution-style semantics for GL programs which bears the same kind of relation to extended disjunctive logic programs as SLD resolution bears to SLDNF resolution in the non-disjunctive case, and provides an operational semantics based on nondeterministic state transitions.
Formal Concept Analysis and Resolution in Algebraic Domains
TLDR
It is shown how to identify the notion of formal concept in the domain theoretic setting and it is shown that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis.
Resolution and Logic Programming in Algebraic Domains: Negation and Defaults
TLDR
This work extends the framework to include reasoning with negative information, i.e. the implicit or explicit absence of bits of information, to lead to a form of default reasoning which is strongly related to logic programming with answer sets or stable models.
A logic for Lawson compact algebraic L-domains
Formal Concept Analysis and Resolution on Algebraic Domains - Preliminary Report
TLDR
It is shown how to identify the notion of formal concept in the domain theoretic setting and it is shown that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis.
Continuous L-domains in logical form
Semantics of logic programs with aggregates
TLDR
A framework admits arbitrary aggregate relations in the bodies of rules which follows a denotational approach in which a semantics is defined as a (set of) fixpoint(s) of an operator associated with a program.
Default Reasoning over Domains and Concept Hierarchies
TLDR
A default reasoning paradigm for conceptual knowledge which is in accordance with mainstream developments in nonmonotonic reasoning is obtained and it is shown that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis.
Reasoning with power defaults
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 35 REFERENCES
Semantics of Logic Programs and Representation of Smyth Powerdomain
TLDR
This paper provides a representation of the Smyth powerdomain in order to base the semantics of logic programs on Scott's information systems, and establishes an order-isomorphism between disjunctive states and compact, saturated sets, for which injectivity and surjectivity correspond to the soundness and completeness of hyperresolution.
Domain Theory in Logical Form
Higher-Order Logic Programming
TLDR
This paper uses a higher-order logic to describe a generalization to first-order Horn clauses, and shows that the familiar operational and least fixpoint semantics can be given to these clauses.
Sequents, Frames, and Completeness
TLDR
An analysis of the freely generated frames from entailment relations is given and completeness results under the unifying principle of the spatiality of coherence logic are obtained.
Power Defaults
We present a spectrum of default logics, using powerdomains to encode default constraints. The resulting nonmonotonic entailment relations all satisfy the law of reasoning by cases. This result is a
Experimenting with Power Default Reasoning
TLDR
This paper takes advantage of the computational aspects of Propositional Power Default Reasoning in an implementation called powdef to encode and solve hard graph problems and explore randomly generated instances of skeptical entailment.
Complexity of power default reasoning
TLDR
A new and surprisingly low complexity result for inference in a new form of Reiter's propositional default logic, using Scott's domain theory to integrate defaults into partial model theory of the logic, instead of keeping defaults as quasiproof rules in the syntax.
Foundations of disjunctive logic programming
TLDR
This paper discusses first-order theory - syntax first order theory - semantics logic programs - syntax Logic programs - semantics - models and interpretations substitutions and unifiers fixpoint theory, a comparison of definite and disjunctive logic programs and normal logic programs.
Topology via Logic
1. Introduction 2. Affirmative and refutative assertions 3. Frames 4. Frames as algebras 5. Topology: the definitions 6. New topologies for old 7. Point logic 8. Compactness 9. Spectral algebraic
...
1
2
3
4
...