700 search results - page 117 / 140 » On Termination of Constraint Logic Programs |
ATVA
2010
Springer
15 years 5 days ago
2010
Springer
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
JAR
2008
14 years 11 months ago
2008
Abstract We present an extensible encoding of object-oriented data models into higherorder logic (HOL). Our encoding is supported by a datatype package that leverages the use of th...
FCT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
100
click to vote
ISMVL
2000
IEEE
15 years 3 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
100
click to vote
ICSOC
2004
Springer
15 years 4 months ago
2004
Springer
Over the last few years several process-based web service composition languages have emerged, such as BPEL4WS and BPML. These languages define the composition on the basis of a pr...