Cited in
(28)- Incremental Algorithms for Local Search from Existential Second-Order Logic
- Compiling problem specifications into SAT
- scientific article; zbMATH DE number 1453071 (Why is no real title available?)
- scientific article; zbMATH DE number 5079838 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- Logic Based Program Synthesis and Transformation
- PBINT, a logic for modelling search problems involving arithmetic
- Extending and implementing the stable model semantics
- Logic Based Program Synthesis and Transformation
- GraphBase
- Smodels
- NoMoRe
- CPGraph
- Zinc
- GraphGrep
- ESRA
- Essence
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Logic programs with stable model semantics as a constraint programming paradigm
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- scientific article; zbMATH DE number 1692952 (Why is no real title available?)
- Declarative problem-solving using the DLV system
- Essence: A constraint language for specifying combinatorial problems
- Extending the Smodels system with cardinality and weight constraints
- Translating OWL and semantic web rules into prolog: Moving toward description logic programs
- Recent Advances in Constraints
- Expressive power and abstraction in Essence
- Breaking instance-independent symmetries in exact graph coloring
This page was built for software: NP-SPEC
