Broadly, our research concerns the fusion of logicprogramming (LP) andDescription logics (DLs), two solid knowledge representation paradigms with largely dual *** two feature different semantics and orthogonal expres...
详细信息
Computational Indistinguishability logic (CIL) is a logic for reasoning about cryptographic primitives in computational model. It is sound for standard model, but also supports reasoning in the random oracle and other...
详细信息
ISBN:
(数字)9783642412271
ISBN:
(纸本)9783642412271;9783642412264
Computational Indistinguishability logic (CIL) is a logic for reasoning about cryptographic primitives in computational model. It is sound for standard model, but also supports reasoning in the random oracle and other idealized models. We illustrate the benefits of CIL by formally proving the security of a Password-Based Key Exchange (PBKE) scheme, which is designed to provide entities communicating over a public network and sharing a short password, under a session key.
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.
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.
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.
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.
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logic Programmin...
详细信息
ISBN:
(纸本)3540632557
this paper gives a brief high-level description of the implementation of a disjunctive logicprogramming system referred to as DisLoP. this system is a result of research activities of the Disjunctive logicprogramming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz since July 1995.
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...
详细信息
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.
暂无评论