Formulating the template ILP consistency problem as a constraint satisfaction problem

DOI10.1007/S10601-013-9141-7zbMATH Open1309.90054OpenAlexW1978371573MaRDI QIDQ487650FDOQ487650

Roman Bartak, Ondřej Kuželka, Radomír Černoch, 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

inductive logic programmingmeta-reasoningconstraint modeling

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

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

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)