Sciweavers

193 search results - page 23 / 39
» On the Epistemological foundations of Logic Programming and ...
Sort
View
DIMACS
1996
15 years 3 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
DAC
2003
ACM
16 years 2 months ago
Behavioral consistency of C and verilog programs using bounded model checking
We present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking. Both the circuit and the program ...
Edmund M. Clarke, Daniel Kroening, Karen Yorav
LOBJET
2008
104views more  LOBJET 2008»
15 years 1 months ago
Une approche formelle de la reconfiguration dynamique
Self-adapting software adapts its behavior in an autonomic way, by dynamically adding, suppressing and recomposing components, and by the use of computational reflection. One way t...
M. Simonot, M. Aponte
ICLP
2005
Springer
15 years 7 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
ENTCS
2002
84views more  ENTCS 2002»
15 years 1 months ago
Programming Autonomous Robots in Curry
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
Michael Hanus, Klaus Höppner