Sciweavers

2084 search results - page 68 / 417
» Set Constraints in Logic Programming
Sort
View
ASP
2003
Springer
14 years 1 months ago
Translation of Aggregate Programs to Normal Logic Programs
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
ICLP
2004
Springer
14 years 1 months ago
Multi-agent Coordination as Distributed Logic Programming
A novel style of multi-agent system specification and deployment is described, in which familiar methods from computational logic are re-interpreted to a new context. One view of ...
David Robertson
CP
2004
Springer
14 years 1 months ago
Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
Andrew Sadler, Carmen Gervet
CAV
2009
Springer
134views Hardware» more  CAV 2009»
14 years 8 months ago
Predecessor Sets of Dynamic Pushdown Networks with Tree-Regular Constraints
Abstract. Dynamic Pushdown Networks (DPNs) are a model for parallel programs with (recursive) procedures and process creation. The goal of this paper is to develop generic techniqu...
Alexander Wenner, Markus Müller-Olm, Peter La...
ICLP
2009
Springer
14 years 8 months ago
Qualified Computations in Functional Logic Programming
Abstract. Qualification has been recently introduced as a generalization of uncertainty in the field of Logic Programming. In this paper we investigate a more expressive language f...
Rafael Caballero, Mario Rodríguez-Artalejo,...