Results 1  10
of
237
DESIGN, IMPLEMENTATION, AND EVALUATION OF THE CONSTRAINT LANGUAGE cc(FD)
 J. LOGIC PROGRAMMING 1994:19, 20:1679
, 1994
"... This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over finite domains based on the cc framework [33], an extension of the CLP scheme [21]. Its constraint solver includes (nonl ..."
Abstract

Cited by 187 (9 self)
 Add to MetaCart
This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over finite domains based on the cc framework [33], an extension of the CLP scheme [21]. Its constraint solver includes (non
Incremental Execution of Transformation Specifications
 IN PROCEEDINGS OF THE 31ST ACM SIGPLANSIGACT SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
, 2004
"... We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require nontrivial program analysis to check their applicability, and it is prohibitively expensive to rerun such analyses after eac ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
of language factors. The first allows the neat specification of transformations, while the second opens the way for an incremental implementation. The two ideas are linked by using regular patterns instead of Steffen's modal logic: these patterns can be viewed as queries on the set of program paths.
Efficient Incremental Checkpointing of Java Programs
"... tel:+33.2.99.84.72.87, fax:+33.2.99.84.71.71 This paper investigates the optimization of languagelevel checkpointing of Java programs. First, we describe how to systematically associate incremental checkpoints with Java classes. While being safe, the genericness of this solution induces substantial ..."
Abstract
 Add to MetaCart
classes, (ii) knowledge of unmodified data structures in specific program phases. The latter information allows us to generate phasespecific checkpointing methods. We evaluate our approach on two benchmarks, a realistic application which consists of a program analysis engine, and a synthetic program
Program Dependence Analysis of Concurrent Logic Programs and Its Applications
 Proc. 1996 IEEECS International Conference on Parallel and Distributed Systems
, 1996
"... In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two languageindependent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program. Then ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two languageindependent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program
Abduction and beyond in logic programming with application to morality. Accepted
 in “Frontiers of Abduction”, Special Issue in IfCoLog Journal of Logics
, 2015
"... In this paper we emphasize two different aspects of abduction in Logic Programming (LP): (1) the engineering of LP abduction systems, and (2) application of LP abduction, complemented with other nonmonotonic features, to model morality issues. For the LP engineering part, we present an implemente ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
In this paper we emphasize two different aspects of abduction in Logic Programming (LP): (1) the engineering of LP abduction systems, and (2) application of LP abduction, complemented with other nonmonotonic features, to model morality issues. For the LP engineering part, we present
Abstract Incremental Execution of Transformation Specifications
"... We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require nontrivial program analysis to check their applicability, and it is prohibitively expensive to rerun such analyses after eac ..."
Abstract
 Add to MetaCart
factors. The first allows the neat specification of transformations, while the second opens the way for an incremental implementation. The two ideas are linked by using regular patterns instead of Steffen’s modal logic: these patterns can be viewed as queries on the set of program paths. Categories
Optimizing Modular Logic Languages
, 1998
"... Several applications in the areas of Software Engineering and Artificial Intelligence require support for modular programming and incremental knowledge organization. Modular logic programming has been studied along two orthogonal lines of research (see [Bugliesi et al. 1994] for a survey). In the fi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Several applications in the areas of Software Engineering and Artificial Intelligence require support for modular programming and incremental knowledge organization. Modular logic programming has been studied along two orthogonal lines of research (see [Bugliesi et al. 1994] for a survey
Towards Practical Interval Constraint Solving in Logic Programming
 IN LOGIC PROGRAMMING: PROCEEDINGS OF THE 1994 INTERNATIONAL SYMPOSIUM
, 1994
"... Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving linear systems, which constitute an important class of problems in engineering and other applications. In this paper, an interval linear equality ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving linear systems, which constitute an important class of problems in engineering and other applications. In this paper, an interval linear equality
Interval Linear Constraint Solving in Constraint Logic Programming
, 1994
"... Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving general systems of constraints over real, which constitute an important class of problems in engineering and other applications. In this thesis, w ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Existing interval constraint logic programming languages, such as BNR Prolog, work under the framework of interval narrowing and are deficient in solving general systems of constraints over real, which constitute an important class of problems in engineering and other applications. In this thesis
Materials for an exploratory theory of the network society.
 The British Journal of Sociology
, 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, crosscultural investigation. It permeates most societies in the world, in v ..."
Abstract

Cited by 122 (0 self)
 Add to MetaCart
that the automaton will follow? Social actors, naturally. Thus, there is a social struggle to assign goals to the network. But once the network is programmed, it imposes its logic to all its members (actors). Actors will have to play their strategies within the rules of the network. To assign different goals
Results 1  10
of
237