Direkt zum Inhalt

Lottaz, Claudio

Rewriting numeric constraint satisfaction problems for consistency algorithms (short paper)

Lottaz, Claudio (1999) Rewriting numeric constraint satisfaction problems for consistency algorithms (short paper). In: Jaffar, Joxan, (ed.) Principles and Practice of Constraint Programming – CP’99. Lecture Notes in Computer Science, 1713. Springer, Berlin, pp. 486-487. ISBN 978-3-540-48085-3 (online). 978-3-540-66626-4 (print).

Date of publication of this fulltext: 30 Jul 2020 06:53
Book section



Involved Institutions


Details

Item typeBook section
ISBN978-3-540-48085-3 (online). 978-3-540-66626-4 (print)
Title of Book:Principles and Practice of Constraint Programming – CP’99
Publisher:Springer
Place of Publication:Berlin
Other Series:Lecture Notes in Computer Science
Volume:1713
Page Range:pp. 486-487
Date1999
InstitutionsMedicine > Institut für Funktionelle Genomik > Lehrstuhl für Statistische Bioinformatik (Prof. Spang)
Informatics and Data Science > Department Computational Life Science > Lehrstuhl für Statistische Bioinformatik (Prof. Spang)
Identification Number
ValueType
10.1007/978-3-540-48085-3_39DOI
Keywordsconsistency algorithm numeric constraint satisfaction problem short paper numeric csps mathematical expression ternary constraint exponential complexity unnecessary variable common procedure constraint satisfaction problem arity csps csp arity low arity csps several consistency algorithm present algorithm high arity csps original csp constraint satisfaction theoretical view much work discrete domain introduced auxiliary variable auxiliary variable binary csps binary operator binary form
Dewey Decimal Classification600 Technology > 610 Medical sciences Medicine
StatusPublished
RefereedUnknown
Created at the University of RegensburgNo
Item ID43517

Export bibliographical data

Owner only: item control page

nach oben