Formulating the template ILP consistency problem as a constraint satisfaction problem (Q487650): Difference between revisions

@@ Property / DOI @@
-.1007/s10601-013-9141-7
@@ Property / DOI: 10.1007/s10601-013-9141-7 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C09
@@ Property / Mathematics Subject Classification ID: 90C09 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6389806
@@ Property / zbMATH DE Number: 6389806 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+constraint modeling
@@ Property / zbMATH Keywords: constraint modeling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inductive logic programming
@@ Property / zbMATH Keywords: inductive logic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+meta-reasoning
@@ Property / zbMATH Keywords: meta-reasoning / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+nFOIL
@@ Property / describes a project that uses: nFOIL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Aleph
@@ Property / describes a project that uses: Aleph / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10601-013-9141-7
+Normal rank
@@ Property / OpenAlex ID @@
+W1978371573
@@ Property / OpenAlex ID: W1978371573 / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint-based scheduling: Applying constraint programming to scheduling problems.
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Building decision procedures for modal logics from propositional decision procedures: The case study of modal \(K(m)\).
+Normal rank
@@ Property / cites work @@
+Fast theta-subsumption with constraint satisfaction algorithms
+Normal rank
@@ Property / cites work @@
+Inductive Logic Programming: Theory and methods
@@ Property / cites work: Inductive Logic Programming: Theory and methods / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10601-013-9141-7
@@ Property / DOI: 10.1007/S10601-013-9141-7 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:487650