Results 1  10
of
1,748
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Unranked tree automata with sibling equalities and disequalities
, 2006
"... We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSOformulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem for the deter ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSOformulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem
Ground Reducibility and Automata with Disequality Constraints
 Proc. 11th Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science
, 1994
"... Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R. Introduction Ground reducibility of a term ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Using the automata with constraints, we give an algorithm for the decision of ground reducibility of a term t w.r.t. a rewriting system R. The complexity of the algorithm is doubly exponential in the maximum of the depths of t and R and the cardinal of R. Introduction Ground reducibility of a term
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting of mu ..."
Abstract

Cited by 459 (36 self)
 Add to MetaCart
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and applicationoriented customization of constraint systems. CHR are a declarative language extension especially designed for writing userdefined constraints. CHR are essentially a committedchoice language consisting
Tree automata with global constraints
 In 12th Int. Conf. in Developments in Lang. Theory (DLT), vol. 5257 of LNCS
, 2008
"... Abstract. A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so that whenever ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract. A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so
Cute: a concolic unit testing engine for c
 IN ESEC/FSE13: PROCEEDINGS OF THE 10TH EUROPEAN
, 2005
"... In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the pro ..."
Abstract

Cited by 467 (21 self)
 Add to MetaCart
to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation of such test inputs. Finally, CUTE, a tool implementing the method is described together
Systematic Nonlinear Planning
 In Proceedings of the Ninth National Conference on Artificial Intelligence
, 1991
"... This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation. Previous planners have been designed directly ..."
Abstract

Cited by 440 (3 self)
 Add to MetaCart
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general, and independently verifiable, lifting transformation. Previous planners have been designed directly
The emptiness problem for tree automata with global constraints
 in: 25th Annual IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer
, 2010
"... Abstract—We define tree automata with global constraints (TAGC), generalizing the class of tree automata with global equality and disequality constraints [1] (TAGED). TAGC can test for equality and disequality between subterms whose positions are defined by the states reached during a computation. I ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract—We define tree automata with global constraints (TAGC), generalizing the class of tree automata with global equality and disequality constraints [1] (TAGED). TAGC can test for equality and disequality between subterms whose positions are defined by the states reached during a computation
Tree Automata with Equality Constraints Modulo Equational Theories
 Proceedings of 3rd International Joint Conference on Automated Reasoning, IJCAR, volume 4130 of Lecture Notes in Artificial Intelligence
, 2006
"... Abstract. This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
Abstract. This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard
Disequalities May Help to Narrow
"... A constructorbased rewriting logic (CRWL) has been recently proposed as an appropriate basis for functional logic programming. In this paper we extend such framework, to cope with disequality constraints, which are a useful and expressive resource from the point of view of programming. As an import ..."
Abstract
 Add to MetaCart
A constructorbased rewriting logic (CRWL) has been recently proposed as an appropriate basis for functional logic programming. In this paper we extend such framework, to cope with disequality constraints, which are a useful and expressive resource from the point of view of programming
Results 1  10
of
1,748