Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Bockmayr, Alexander

dblp



Editor(s):

Benhamou, F.
Colmerauer, A.

dblp
dblp



BibTeX cite key*:

Bockmayr93b

Title, Booktitle

Title*:

Logic Programming with Pseudo-Boolean Constraints

Booktitle*:

Constraint Logic Programming---Selected Research

Event, URLs

URL of the conference:


URL for downloading the paper:


Event Address*:

?

Language:

English

Event Date*
(no longer used):

?

Organization:


Event Start Date:

24 July 2019

Event End Date:

24 July 2019

Publisher

Name*:

MIT Press

URL:


Address*:

Cambridge, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

327-350

Year*:

1993

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©

Note:

Also available as Research Report MPI-I-91-227

(LaTeX) Abstract:

Boolean constraints play an important role in various constraint logic programming languages. In this paper we consider pseudo-Boolean constraints, that is equations and inequalities between pseudo-Boolean functions. A pseudo-Boolean function is an integer-valued function of Boolean variables and thus a generalization of a Boolean function. Pseudo-Boolean functions occur in many application areas, in particular in problems from operations research. An interesting connection to logic is that inference problems in propositional logic can be translated into linear pseudo-Boolean optimization problems. More generally, pseudo-Boolean constraints can be seen as a particular way of combining two of the most important domains in constraint logic programming: arithmetic and Boolean algebra. In this paper we define a new constraint logic programming language CLP(${\cal PB}$) for logic progamming with pseudo-Boolean constraints. The language is an instance of the general constraint logic programming language scheme
CLP(${\cal X}$) and inherits all the typical semantic properties. We show that any pseudo-Boolean constraint has a most general solution and give variable elimination algorithms for pseudo-Boolean unification and unconstrained pseudo-Boolean optimization. Both algorithms subsume the well-known Boolean unification algorithm of B{\"u}ttner and Simonis.



Download
Access Level:


Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

experts only

Appearance:

CCL bibliography



BibTeX Entry:

@INPROCEEDINGS{Bockmayr93b,
AUTHOR = {Bockmayr, Alexander},
EDITOR = {Benhamou, F. and Colmerauer, A.},
TITLE = {Logic Programming with Pseudo-Boolean Constraints},
BOOKTITLE = {Constraint Logic Programming---Selected Research},
PUBLISHER = {MIT Press},
YEAR = {1993},
PAGES = {327--350},
ADDRESS = {?},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Uwe Brahm
Created
01/14/1995 06:50:53 PM
Revisions
4.
3.
2.
1.
0.
Editor(s)
Christine Kiesel
Christine Kiesel
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Uwe Brahm/MPII/DE
Edit Dates
04.09.2001 12:28:07
04.09.2001 12:27:45
21/01/95 20:46:19
17/01/95 21:14:34
14/01/95 19:00:53