ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abduction is usually carried out on partially-defined predicates. In this paper we investigate abduction applied to fully-defined predicates, specifically linear arithmetic cons...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a reactive programming and triggering framework for the coordination of a large number of distributed agents with shared knowledge. At the heart of this framewo...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
ICLP
2005
Springer
13 years 10 months ago
2005
Springer
