Sciweavers

641 search results - page 31 / 129
» Embedding Finite Sets in a Logic Programming Language
Sort
View
CP
2007
Springer
14 years 2 months ago
Propagation = Lazy Clause Generation
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
CADE
2008
Springer
14 years 8 months ago
Collaborative Programming: Applications of Logic and Automated Reasoning
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming lan...
Timothy L. Hinrichs
SAC
2010
ACM
14 years 3 months ago
A real-time architecture design language for multi-rate embedded control systems
This paper presents a language dedicated to the description of the software architecture of complex embedded control systems. The language relies on the synchronous approach but e...
Julien Forget, Frédéric Boniol, Davi...
DIMACS
1996
13 years 9 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
CAISE
2004
Springer
14 years 1 months ago
Network-based Business Process Management: a Discussion on Embedding Business Logic in Communications Networks
Advanced Business Process Management (BPM) tools enable the decomposition of previously integrated and often ill-defined processes into reusable process modules. These process modu...
Louis-François Pau, Peter H. M. Vervest