Sciweavers

1097 search results - page 158 / 220
» Revision Programming = Logic Programming Integrity Constra...
Sort
View
ICLP
1990
Springer
15 years 7 months ago
Kernel Andorra Prolog and its Computation Model
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
Seif Haridi, Sverker Janson
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 3 months ago
Cardinality heterogeneities in Web service composition: Issues and solutions
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
Michael Mrissa, Philippe Thiran, Jean-Marie Jacque...
89
Voted
ANOR
2002
67views more  ANOR 2002»
15 years 3 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
FCT
2007
Springer
15 years 9 months ago
Rewriting Systems with Data
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...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 7 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
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...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...