We discuss a new concept of agent programs that combines logicprogramming withreasoning about actions. these agent logic programs are characterized by a clear separation between the specification of the agent's ...
详细信息
ISBN:
(纸本)9783642042218
We discuss a new concept of agent programs that combines logicprogramming withreasoning about actions. these agent logic programs are characterized by a clear separation between the specification of the agent's strategic behavior and the underlying theory about the agent's actions and their effects. this makes it a generic, declarative agent programming language, which can be combined with an action representation formalism of one's choice. We present a declarative semantics for agent logic programs along with (two versions of) a sound and complete operational semantics, which combines the standard inference mechanisms for (constraint) logic programs withreasoning about actions.
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) comp...
详细信息
ISBN:
(纸本)3540632557
the program composition approach can be fruitfully applied to combine general logic programs, i.e, logic programs possibly containing negative premises. We show how the introduction of a basic set of (meta-level) composition operations over general programs increases the knowledge representation capabilities of logicprogramming for non-monotonic reasoning. Examples of modular programming, hierarchical reasoning, constraints, and rules with exceptions will be illustrated. the semantics of programs and program compositions is defined in terms of three-valued logic [15]. the computational interpretation of program compositions is formalised by an equivalence preserving syntactic transformation of arbitrary program compositions into standard general programs.
Disjunctive logicprogramming (DLP) under the answer set semantics is an advanced formalism for knowledge representation and reasoning. It is generally considered more expressive than normal (disjunction-free) logic P...
详细信息
ISBN:
(纸本)354020721X
Disjunctive logicprogramming (DLP) under the answer set semantics is an advanced formalism for knowledge representation and reasoning. It is generally considered more expressive than normal (disjunction-free) logicprogramming, whose expressiveness is limited to properties decidable in NP. However, this higher expressiveness comes at a computational cost, and while there are several efficient systems for the normal case, we are only aware of few solid implementations for full DLP. In this paper we investigate novel techniques to couple two main modules (a model generator and a model checker) commonly found in DLP systems more tightly. Instead of using the checker only as a boolean oracle, in our approach, upon a failed check it also returns a so-called unfounded set. Intuitively, this set explains why a model candidate is not an answer set, and the generator employs this knowledge to backtrack until that set is no longer unfounded, which is vastly more efficient than employing full-fledged model checks to control backtracking. Furthermore, we invoke the checker not only for actual model candidates, but also on partial models during model generation to possibly prune the search space. We implemented these approaches in DLV, a state-of-the-art implementation of DLP according to recent comparisons, and carried out experiments;tests on hard benchmark instances show a significant speedup of a factor of two and above.
Withthe advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck du...
详细信息
ISBN:
(纸本)9783540784685
Withthe advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. We develop the algorithm from thorough theoretical foundations and report on a prototype implementation.
We describe the development of a constraint logicprogramming based system, called CPP, which is capable of generating most preferred plans with respect to a user's preference and evaluate its performance.
ISBN:
(纸本)9783540721994
We describe the development of a constraint logicprogramming based system, called CPP, which is capable of generating most preferred plans with respect to a user's preference and evaluate its performance.
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasi...
详细信息
ISBN:
(纸本)9783540721994
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approaches of lparse and dlv. A major emphasis lies on an extensible design that allows for an easy incorporation of new language features in an efficient system environment.
the problem of automatedtheorem finding is one of 33 basic research problems in automatedreasoning which was originally proposed by Wos. the problem is still an open problem until now. To solve the problem, a system...
详细信息
ISBN:
(纸本)9783662474877;9783662474860
the problem of automatedtheorem finding is one of 33 basic research problems in automatedreasoning which was originally proposed by Wos. the problem is still an open problem until now. To solve the problem, a systematic methodology with forward reasoning based on strong relevant logic has been proposed. this paper presents a case study of automatedtheorem finding in graph theory to show the generality of the methodology, and presents a future direction for automatedtheorem finding based on the methodology.
We continue the investigations of [Ra90, Ra91, RM89] and study the automatedtheorem proving for reasoning about perception of reasoning agents and their consensus reaching. Using the techniques of [Ra91] and of logic...
详细信息
Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the info...
详细信息
ISBN:
(纸本)9783642042379
Although knowing the operating systems running in a network is becoming more and more important (mainly for security reasons), current operating system discovery tools are not sufficiently accurate to acquire the information in a fully automated way. Many design choices explain this lack of accuracy, but they all come down to a poor knowledge representation scheme. In this paper, we study how answer set programming call he used to guide the design of a knowledge-oriented operating system discovery tool. the result is significantly more accurate than today's state of the art tools.
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+K(D) is introduced. It cannot only be able to represent knowledge about concrete domain and constraints, b...
详细信息
ISBN:
(纸本)1595931120
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+K(D) is introduced. It cannot only be able to represent knowledge about concrete domain and constraints, but also rules in some sense of closed world semantic model hypothesis. Also the paper investigates an extension to description logic (DL) based knowledge reasoning by means of decomposing and rewriting complicated hybrid concepts into partitions. We present an approach that automatically decomposes the whole knowledge base into description logic compatible one and constraints solver one. Our arguments are two-fold. First, complex DLs with powerful representation ability lack effective reasoning ability. Second, we are concerned with how to reason effectively withthe combination of inferences from distributed heterogeneous reasoner.
暂无评论