Sciweavers

1613 search results - page 136 / 323
» Functional and Constraint Logic Programming
Sort
View
143
Voted
CADE
2002
Springer
16 years 4 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
174
Voted
WOA
2004
15 years 5 months ago
A Game-Theoretic Operational Semantics
Abstract-- In this paper we present the communication architecture of the DALI Logic Programming Agent-Oriented language and we discuss its semantics. We have designed a meta-level...
Arianna Tocchio, Stefania Costantini, Alessia Vert...
155
Voted
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 3 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron
230
Voted
CP
2009
Springer
16 years 4 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
141
Voted
IOR
2007
106views more  IOR 2007»
15 years 3 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker