Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set programming, a prominent rule-based declarative programm...
详细信息
ISBN:
(纸本)9783319234854;9783319234847
Even though modularity has been studied extensively in conventional logic programming, there are few approaches on how to incorporate modularity into Answer Set programming, a prominent rule-based declarative programming paradigm. A major approach is Oikarinnen and Janhunen's Gaifman-Shapiro-style architecture of program modules, which provides the composition of program modules. Their module theorem properly strengthens Lifschitz and Turner's splitting set theorem for normal logic programs. However, this approach is limited by module conditions that are imposed in order to ensure the compatibility of their module system with the stable model semantics, namely forcing output signatures of composing modules to be disjoint and disallowing positive cyclic dependencies between different modules. These conditions turn out to be too restrictive in practice and after recently discussing alternative ways of lifting the first restriction [17], we now show how one can allow positive cyclic dependencies between modules, thus widening the applicability of this framework and the scope of the module theorem.
Recent progress in logic programming, particularly answer set programming, has enabled us to teach it to undergraduate and high school students. We developed an online answer set programming environment with simple in...
详细信息
ISBN:
(纸本)9781577357605
Recent progress in logic programming, particularly answer set programming, has enabled us to teach it to undergraduate and high school students. We developed an online answer set programming environment with simple interface and self contained file system. It is expected to make the teaching of answer set programming more effective and help us to reach more students.
In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the constr...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
In this paper we show how protocol insecurity problems expressed in a multi-set rewriting formalism can be automatically translated into logic programming problems. The proposed translation paves the way to the construction of model-checkers for security protocols based on state-of-the-art solvers for logic programs. We have assessed the effectiveness of the approach by running the proposed reduction against a selection of insecurity problems drawn from the Clark & Jacob library of security protocols: by running state-of-the-art solvers against the resulting logic programming problems most of the (known) attacks on the considered protocols are found in a few seconds.
The research of the Fifth Generation Computer Project was conducted based on a single principle: logic programming. logic programming unifies the ideas of retrieval and computation. Both of these can be regarded as fo...
详细信息
作者：
ARNI, NGRECO, SSACCA, DMCC
Balcones Center Dr. 3500 Austin 78759 TX United States DEIS
Università della Calabria Rende 87030 Italy
This paper is concerned with the unification of set terms that differ from standard terms because of the commutative and idempotent properties. The main results are the detailed complexity analysis of the problem of s...
详细信息
This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on A-abstractions, using an instanc...
详细信息
ISBN:
(纸本)9783642177958
This paper presents a theoretical framework for the integration of the cooperative constraint solving of several algebraic domains into higher-order functional and logic programming on A-abstractions, using an instance of a generic Constraint Functional logic programming (CFLP) scheme over a so-called higher-order coordination domain. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers and integers, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the algebraic domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functional logic system TOY.
Planning and simulation models share the characteristic that they involve reasoning about hypothetical sequences of activities. These may be naturally described in a graph structure, e.g., a state transition diagram o...
详细信息
Different extensions to logic programming have recently been introduced to deal with abductive reasoning. In this work we address the issue of how to process abductive reasoning in the field of logic programming by fo...
详细信息
We formalize negotiations using logic programming with consistency restoring rules (or CR-Prolog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We ...
详细信息
ISBN:
(纸本)9781577354260
We formalize negotiations using logic programming with consistency restoring rules (or CR-Prolog) [Balduccini and Gelfond, 2003]. Our formulation deals with incomplete information, preferences, and changing goals. We assume that each agent is equipped with a knowledge base for negotiation which consists of a CR-program, a set of possible assumptions, and a set of ordered goals. We use the notion of an answer set as a means to formalize the basic notions of negotiation such as proposal, response, negotiation, negotiation tree (protocol), etc. and discuss their properties.
PROFIT is a system and a programming language where Prolog is extended with concepts needed in compiler writing applications. The special facilities include a deterministic error-recovering form of definite clause gra...
详细信息
暂无评论