NP-SPEC
From MaRDI portal
Software:14787
swMATH2243MaRDI QIDQ14787FDOQ14787
Author name not available (Why is that?)
Cited In (20)
- Compiling problem specifications into SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Logic programs with stable model semantics as a constraint programming paradigm
- Title not available (Why is that?)
- Declarative problem-solving using the DLV system
- Extending the Smodels system with cardinality and weight constraints
- Essence: A constraint language for specifying combinatorial problems
- 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
- Incremental Algorithms for Local Search from Existential Second-Order Logic
This page was built for software: NP-SPEC
