Numeric constraint resolution in logic programming based on subdefinite models

DOI10.1007/3-540-40888-6_17MaRDI QIDQ4473377zbMATH OpenFDO

Authors Evgueni S. Petrov

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1909/19090180.htm

Mathematics Subject Classification ID

Logic programming (68N17) Computing methodologies and applications (68U99)

Recommendations

• Levels of concurrency in constraint satisfaction problems with subdefinite objects
• An interval library: The experience of integration of logic and constraint programming
• The logic programming paradigm in numerical computation
• Logic Programs with Abstract Constraint Atoms: The Role of Computations
• Logic programs with stable model semantics as a constraint programming paradigm

Cited in

(4)

• scientific article; zbMATH DE number 1822452 (Why is no real title available?)
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
• Levels of concurrency in constraint satisfaction problems with subdefinite objects
• An interval library: The experience of integration of logic and constraint programming

This page was built for publication: Numeric constraint resolution in logic programming based on subdefinite models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473377)