Sciweavers

2084 search results - page 87 / 417
» Set Constraints in Logic Programming
Sort
View
AMAST
2010
Springer
13 years 3 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
AAAI
2008
13 years 9 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
CP
2009
Springer
14 years 8 months ago
SOGgy Constraints: Soft Open Global Constraints
We investigate soft open constraints. We generalize and unify classes of soft constraints and adapt them to the open setting. We give sufficient conditions for generalized classes ...
Michael J. Maher
ENDM
2010
126views more  ENDM 2010»
13 years 8 months ago
A 0/1 Integer Programming Model for the Office Space Allocation Problem
We propose a 0/1 integer programming model to tackle the office space allocation (OSA) problem which refers to assigning room space to a set of entities (people, machines, roles, ...
Özgür Ülker, Dario Landa-Silva
AADEBUG
2000
Springer
14 years 13 days ago
Value Withdrawal Explanation in CSP
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
Gérard Ferrand, Willy Lesaint, Alexandre Te...