this book constitutes the refereed proceedings of the 18th international conference on logic programming, iclp 2002, held in Copenhagen, Denmark, in July/August 2002.;the 29 revised full papers presented together with...
详细信息
ISBN:
(数字)9783540456193
ISBN:
(纸本)9783540439301
this book constitutes the refereed proceedings of the 18th international conference on logic programming, iclp 2002, held in Copenhagen, Denmark, in July/August 2002.;the 29 revised full papers presented together with two invited contributions and 13 posters were carefully reviewed and selected from 82 submissions. All current aspects of logicprogramming and computational logic are addressed.
In this paper we show that the language of declarative logicprogramming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness o...
详细信息
ISBN:
(纸本)0769515312
In this paper we show that the language of declarative logicprogramming (DLP) with answer sets and its extensions can be used to specify database evolution due to updates and active rules, and to verify correctness of active rules with respect to a specification described using temporal logic and aggregate operators. We classify the specification of active rules into four kind of constraints which can be expressed using a particular extension of DLP called Smodels. Smodels allows us to specify the evolution, to specify the constraints, and to enumerate all possible initial database states and initial updates. Together, these can be used to analyze all possible evolution paths of an active database system to verify if they satisfy a set of given constraints.
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logicprogramming has been inappropriate for the study of the running time of algorithms because t...
详细信息
ISBN:
(纸本)3540439307
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logicprogramming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logicprogramming model of computation appropriate for the study of the run time of a wide variety of algorithms.
We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.
ISBN:
(纸本)3540439307
We provide here a declarative and model-theoretic characterization of the approximations computed by consistency during the resolution of finite domain constraint satisfaction problems.
A neural implementation which provides an interesting massively parallel model for computing a fixed-point semantics of a program is introduced for multiadjoint logicprogramming [3]. Distinctive features of this prog...
ISBN:
(纸本)3540439307
A neural implementation which provides an interesting massively parallel model for computing a fixed-point semantics of a program is introduced for multiadjoint logicprogramming [3]. Distinctive features of this programming paradigm are that: very general aggregation connectives in the bodies are allowed; by considering different adjoint pairs, it is possible to use several implications in the rules.
this paper introduces a novel logical framework for concept-learning called brave induction. Brave induction uses brave inference for induction and is useful for learning from incomplete information. Brave induction i...
详细信息
this paper introduces a novel logical framework for concept-learning called brave induction. Brave induction uses brave inference for induction and is useful for learning from incomplete information. Brave induction is weaker than explanatory induction which is normally used in inductive logicprogramming, and is stronger than learning from satisfiability, a general setting of concept-learning in clausal logic. We first investigate formal properties of brave induction, then develop an algorithm for computing hypotheses in full clausal theories. Next we extend the framework to induction in nonmonotonic logic programs. We analyze computational complexity of decision problems for induction on propositional theories. Further, we provide examples of problem solving by brave induction in systems biology, requirement engineering, and multiagent negotiation.
Current trends in Software Engineering and developments in logicprogramming lead us to believe that there will be an opportunity for logicprogramming to make a breakthrough in Software Engineering. In this paper, we...
详细信息
ISBN:
(纸本)3540439307
Current trends in Software Engineering and developments in logicprogramming lead us to believe that there will be an opportunity for logicprogramming to make a breakthrough in Software Engineering. In this paper, we explain how this has arisen, and justify our belief with a real-life application. Above all, we invite fellow workers to take up the challenge that the opportunity offers.
Constraint-logic object-oriented programming is a young programming paradigm that aims to bring constraint-solving techniques to an audience more accustomed to imperative programming. A prototypical language of this p...
详细信息
ISBN:
(纸本)9789897586477
Constraint-logic object-oriented programming is a young programming paradigm that aims to bring constraint-solving techniques to an audience more accustomed to imperative programming. A prototypical language of this paradigm, Muli, allows for the use not only of primitive-typed free variables, but also for free objects and free arrays of primitive-typed elements. In the work at hand, we extend the current version of Muli so that it supports free arrays of arrays and free arrays of objects. We do so by utilizing the concept of symbolic aliasing. Our evaluation shows that the presented approach can speed up program validation and test case generation, as well as solving complex constraint satisfaction problems.
Higher-order logicprogramming languages such as Elf extend first-order logicprogramming in two ways: first-order terms axe replaced with (dependently) typed A-terms and the body of clauses may contain implication an...
详细信息
ISBN:
(纸本)3540439307
Higher-order logicprogramming languages such as Elf extend first-order logicprogramming in two ways: first-order terms axe replaced with (dependently) typed A-terms and the body of clauses may contain implication and universal quantification. In this paper, we describe tabled higher-order logicprogramming where some redundant computation is eliminated by memoizing sub-computation and re-using its result later. this work extends Tamaki and Sato's search strategy based on memoization to the higher-order setting. We give a proof-theoretic characterization of tabling based on uniform proofs and prove soundness of the resulting interpreter. Based on it, we have implemented a prototype of a tabled logicprogramming interpreter for Elf.
暂无评论