Sciweavers

1144 search results - page 83 / 229
» Logic programming for combinatorial problems
Sort
View
ICFP
2010
ACM
15 years 2 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
ATAL
2000
Springer
15 years 6 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
ICALP
2007
Springer
15 years 6 months ago
Affine Systems of Equations and Counting Infinitary Logic
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
Albert Atserias, Andrei A. Bulatov, Anuj Dawar
CP
2005
Springer
15 years 8 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
AGP
1997
IEEE
15 years 6 months ago
An Algorithm for Learning Abductive Rules
We propose an algorithm for learning abductive logic programs from examples. We consider the Abductive Concept Learning framework, an extension of the Inductive Logic Programming ...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...