θ-Subsumption in a Constraint Satisfaction Perspective
- 30 August 2001
- book chapter
- Published by Springer Nature
- p. 164-178
- https://doi.org/10.1007/3-540-44797-0_14
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Phase Transitions in Relational LearningMachine Learning, 2000
- Foundations of Inductive Logic ProgrammingPublished by Springer Nature ,1997
- Phase transitions and the search problemArtificial Intelligence, 1996
- Inductive Logic Programming: Theory and methodsThe Journal of Logic Programming, 1994
- Decomposing constraint satisfaction problems using database techniquesArtificial Intelligence, 1994
- HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 1993
- Tree clustering for constraint networksArtificial Intelligence, 1989
- On the efficiency of subsumption algorithmsJournal of the ACM, 1985
- Consistency in networks of relationsArtificial Intelligence, 1977
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965