Formulating the template ILP consistency problem as a constraint satisfaction problem

DOI10.1007/S10601-013-9141-7MaRDI QIDQ487650zbMATH OpenOpenAlexFDO

Authors Roman Bartak, Radomír Černoch, Ondřej Kuželka, Filip Železný

Publication date 22 January 2015

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10601-013-9141-7

zbMATH Keywords

constraint modelinginductive logic programmingmeta-reasoning

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Learning Constraint Satisfaction Problems: An ILP Perspective
• The logic of constraint satisfaction
• Inductive Logic Programming: Theory and methods
• scientific article; zbMATH DE number 1875397
• scientific article; zbMATH DE number 54155

Cites work

• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Emergence of Scaling in Random Networks
• Fast theta-subsumption with constraint satisfaction algorithms
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Inductive Logic Programming: Theory and methods

Cited in

(1)

• Inductive Logic Programming

Describes a project that uses

Uses Software

• Aleph
• nFOIL

This page was built for publication: Formulating the template ILP consistency problem as a constraint satisfaction problem

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