the term meta-programming refers to the ability of writing programs that have other programs as data and exploit their semantics [4]. the choice of logicprogramming as a basis for meta-programming offers a number of ...
详细信息
ISBN:
(纸本)9783540429579
the term meta-programming refers to the ability of writing programs that have other programs as data and exploit their semantics [4]. the choice of logicprogramming as a basis for meta-programming offers a number of practical and theoretical advantages. One of them is the possibility of tackling critical foundation problems of meta-programming within a framework with a strong theoretical basis. Another is the surprising ease of programming. these reasons motivated an intensive research on meta-programming inside the logicprogramming community [4],[16],[19],[22],[23].
We propose a new definition of abduction in logicprogramming, and contrast it withthat of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show ...
详细信息
We propose a new definition of abduction in logicprogramming, and contrast it withthat of Kakas and Mancarella's. We then introduce a rewriting system for answering queries and generating explanations, and show that it is both sound and complete under the partial stable model semantics and sound and complete under the answer set semantics when the underlying program is so-called odd-loop free. We discuss an application of the work to a problem in reasoning about actions and provide some experimental results.
Extensionality means, very roughly, that the semantics of a logic program can be explained in terms of the set-theoretic extensions of the relations involved. this allows one to reason about the program by ordinary ex...
详细信息
there was a time when logic was the dominant paradigm for human reasoning. As George Boole put it around one hundred and fifty years ago,logic was synonymous withthe “Laws of thought”. Later, for ...
ISBN:
(纸本)9783540429357
there was a time when logic was the dominant paradigm for human reasoning. As George Boole put it around one hundred and fifty years ago,logic was synonymous withthe “Laws of thought”. Later, for most of the latter half of the twentieth century,it was the mainstream of artificialintelligence. But then it all went wrong. artificialintelligence researchers, frustrated by the lack of progress, blamed many of their problems on the logic-based approach. they argued that humans do not reason logically, and therefore machines should not be designed to reason logically either. Other approaches began to make progress where logic was judged to have failed - approaches that were designed to simulate directly the neurological mechanisms of animal and human intelligence. Insect-like robots began to appear,and the beginning of a new Machine intelligence was born. logic seemed to be dieing - and to be taking logicprogramming (LP) with it.
We are interested in semantical underpinnings for existing approaches to preference handling in extended logicprogramming (within the framework of answer set programming). As a starting point, we explore three differ...
详细信息
We are interested in semantical underpinnings for existing approaches to preference handling in extended logicprogramming (within the framework of answer set programming). As a starting point, we explore three different approaches that have been recently proposed in the literature. Because these approaches use rather different formal means, we furnish a series of uniform characterizations that allow us to gain insights into the relationships among these approaches. To be more precise, we provide different characterizations in terms of (i) fixpoints, (ii) order preservation, and (iii) translations into standard logic programs. While the two former provide semantics for logicprogramming with preference information, the latter furnishes implementation techniques for these approaches.
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs...
ISBN:
(纸本)3540425934
the proceedings contain 39 papers. the topics discussed include: a computational logic approach to heterogeneous agent systems;on the complexity of model checking and inference in minimal models;data integration needs reasoning;nonmonotonic inductive logicprogramming;on the effect of default negation on the expressiveness of disjunctive rules;on the expressibility of stable logicprogramming;on the relationship between defeasible logic and well-founded semantics;a comparative study of well-founded semantics for disjunctive logic programs;reasoning with open logic programs;representation of incomplete knowledge by induction of default theories;explicitly using default knowledge in concept learning: an extended description logics plus strict and default rules;declarative specification and solution of combinatorial auctions using logicprogramming;and planning with different forms of domain-dependent control knowledge - an answer set programming approach.
this paper focuses on the inference of modes for which a logic program is guaranteed to *** generalizes traditional termination analysis where an analyzer tries to verify termination for a specified *** contribution i...
详细信息
An expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of multiple agents is developed. the refinement calculus owes the cleanliness of its deco...
详细信息
Herbrand's theorem for GΔ∞, i.e., Gödel logic enriched by the projection operator Δ is proved. As a consequence we obtain a "chain normal form" and a translation of prenex GΔ∞ into (order) clau...
详细信息
ISBN:
(纸本)9783540429579
Herbrand's theorem for GΔ∞, i.e., Gödel logic enriched by the projection operator Δ is proved. As a consequence we obtain a "chain normal form" and a translation of prenex GΔ∞ into (order) clause logic, referring to the classical theory of dense total orders with endpoints. A chaining calculus provides a basis for efficient theorem proving.
Nonmonotonic logicprogramming (NMLP) and inductive logicprogramming (ILP) are two important extensions of logicprogramming. the former aims at representing incomplete knowledge and reasoning with commonsense, while...
详细信息
暂无评论