Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
112
Towards Soft Typing for CLP
- JICSLP'98 Post-Conference Workshop on Types for Constraint Logic Programming. Ecole Normale Superieure
, 1998
"... The paper links the goals to be achieved by a type system to the problem of partial correctness of CLP programs. Several concepts of type correctness of programs are identified by referring to various known concepts of partial correctness of programs. The type specifications considered in this pape ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
in this paper attach a mode and a type to every predicate of CLP programs. The paper outlines a soft typing approach where optional type specifications given by the user are completed by type inference. Order-sorted languages of types are considered. This gives a natural framework for comparing prescriptive
Towards Testing Concurrent Objects in CLP
, 2012
"... Testing is a vital part of the software development process. It is even more so in the context of concurrent languages, since due to undesired task interleavings and to unexpected behaviours of the underlying task scheduler, errors can go easily undetected. This paper studies the extension of the CL ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
of the CLP-based framework for glass-box test data generation of sequential programs to the context of concurrent objects, a concurrency model which constitutes a promising solution to concurrency in OO languages. Our framework combines standard termination and coverage criteria used for testing sequential
Intelligent Backtracking in CLP(!)
"... Keywords constraint logic programming constraint satisfaction intelligent backtracking CLP(!) 1 Introduction Early in the development of logic programming languages, SLD-resolution and the left-right-depth-first (LRDF) search and computation rule were adopted as a practical approach to implementatio ..."
Abstract
- Add to MetaCart
Keywords constraint logic programming constraint satisfaction intelligent backtracking CLP(!) 1 Introduction Early in the development of logic programming languages, SLD-resolution and the left-right-depth-first (LRDF) search and computation rule were adopted as a practical approach
Towards a declarative and efficient glass-box CLP language
- Workshop Logische Programmierung
, 1994
"... this paper to improve its efficiency. [CaLa94] describes an efficient program to solve a JSSP, whose performance is comparable with those of OR algorithms. For example, it solves the 10\Theta10 JSS benchmark in about 20 minutes. This program is implemented in a hybrid (procedural and declarative) gl ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
) glass-box CLP language. In this paper we have illustrated how it might be possible to encode the techniques suggested in [CaLa94] in a purely declarative glass-box CLP language. FPRs are similar both in syntax and semantics to the CHRs defined in [Fr92], but FPRs are used in the context of if
Towards Compositional CLP-based Test Data Generation for Imperative Languages
"... Test data generation (TDG) is the process of automatically generating test-cases for interesting test coverage criteria. The coverage criteria measure how well the program is exercised by a test suite. Examples of coverage criteria are: statement coverage which requires that each line of the code is ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Test data generation (TDG) is the process of automatically generating test-cases for interesting test coverage criteria. The coverage criteria measure how well the program is exercised by a test suite. Examples of coverage criteria are: statement coverage which requires that each line of the code
Toward a Declarative Language for Negotiating Executable Contracts
, 1999
"... : We give an approach to automating the negotiation of business contracts. Our goal is to develop a language for both (1.) fully-specified, executable contracts and (2.) partially-specified contracts that are in the midst of being negotiated, including via automated auctions. Our starting point for ..."
Abstract
-
Cited by 41 (8 self)
- Add to MetaCart
for this language is Courteous Logic Programs (CLP's), a form of logic-based knowledge representation (KR) that is semantically declarative, intuitively natural, computationally tractable, and practically executable. A CLP is suitable in particular to represent a fully-specified executable contract. The basic
Extending A Parallel Clp Language To Support The Development Of Multi-Agent Systems
- In Proceedings of the 1994 ACM Symposium on Applied Computing
, 1994
"... An extension of the parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to deal with large combinatorial problems that are distributed in nature. Problems of this kind, after being decomposed into s ..."
Abstract
- Add to MetaCart
An extension of the parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to deal with large combinatorial problems that are distributed in nature. Problems of this kind, after being decomposed
COMMON LANGUAGE for PSYCHOTHERAPY (clp) PROCEDURES www.commonlanguagepsychotherapy.org
"... Definition: The therapist repairs a rupture in the therapeutic alliance with the patient by using one or more different procedures. In confrontation ruptures the patient shows problems in the alliance by expressing hostility or criticism toward the therapist. In withdrawal ruptures the patient manif ..."
Abstract
- Add to MetaCart
Definition: The therapist repairs a rupture in the therapeutic alliance with the patient by using one or more different procedures. In confrontation ruptures the patient shows problems in the alliance by expressing hostility or criticism toward the therapist. In withdrawal ruptures the patient
Interactive Querying and Visualisation in Temporal Databases
- Knowledge Discovery and Temporal Reasoning in Deductive and Object-Oriented Databases, Proceedings of the DOOD’95
, 1995
"... Introduction Nowadays it is widely accepted within the database community that the incorporation of temporal capabilities into information systems is a highly desirable feature. Temporal database systems provide efficient and adequate mechanisms for manipulating temporal information. In order for t ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
requests and concentrate on techniques which better exploit the human senses and raise the communication level between humans and machines [1]. Towards this direction we are currently in the process of designing and implementing a Visual Query Language with an interactive Visualiser, as integrated
Abstract EXTENDING A PARALLEL CLP LANGUAGE TO SUPPORT THE DEVELOPMENT OF MULTI-AGENT SYSTEMS
"... An extension of Me parallel constraint logic programming lan-guage ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to deal with large combinatorial problems that are distributed in nature. Prob-lems of this kind, after being decomposed into ..."
Abstract
- Add to MetaCart
An extension of Me parallel constraint logic programming lan-guage ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to deal with large combinatorial problems that are distributed in nature. Prob-lems of this kind, after being decomposed
Results 1 - 10
of
112
