English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Logic-based 0-1 constraint programming

Barth, P. (1995). Logic-based 0-1 constraint programming. Boston, USA: Kluwer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Barth, Peter1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class. Operations research techniques are integrated into a logic programming environment. The first monographic treatment that begins to unify these two methodological approaches. Logic-based methods for modelling and solving combinatorial problems have recently started to play a significant role in both theory and practice. The application of logic to combinatorial problems has a dual aspect. On one hand, constraint logic programming allows one to declaratively model combinatorial problems over an appropriate constraint domain, the problems then being solved by a corresponding constraint solver. Besides being a high-level declarative interface to the constraint solver, the logic programming language allows one also to implement those subproblems that cannot be naturally expressed with constraints. On the other hand, logic-based methods can be used as a constraint solving technique within a constraint solver for combinatorial problems modelled as 0-1 integer programs.

Details

show
hide
Language(s): eng - English
 Dates: 1995
 Publication Status: Issued
 Pages: 272
 Publishing info: Boston, USA : Kluwer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 519551
ISBN: 0-7923-9663-4
Other: Local-ID: C1256104005ECAFC-7F70935ABA4B90D6C125648F007DB153-Barth-95b
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show