NPDatalog: A logic language for expressing NP search and optimization problems
From MaRDI portal
Publication:3550912
Recommendations
Cites work
- scientific article; zbMATH DE number 1312992 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- ASSAT: computing answer sets of a logic program by SAT solvers
- Approximation properties of NP minimization classes
- Autoepistemic logic
- Compiling problem specifications into SAT
- Extending and implementing the stable model semantics
- Greedy algorithms in Datalog
- NP-SPEC: An executable specification language for solving all problems in NP
- Optimization, approximation, and complexity classes
- Predicate-calculus-based logics for modeling and solving search problems
- The DLV system for knowledge representation and reasoning
- The expressive powers of stable models for bound and unbound DATALOG queries
- The expressive powers of the logic programming semantics
- The well-founded semantics for general logic programs
- Why not negation by fixpoint?
Cited in
(7)- scientific article; zbMATH DE number 1407678 (Why is no real title available?)
- scientific article; zbMATH DE number 1420817 (Why is no real title available?)
- NP-SPEC: An executable specification language for solving all problems in NP
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- scientific article; zbMATH DE number 1926632 (Why is no real title available?)
- NP Datalog
- Using linear constraints for logic program termination analysis
This page was built for publication: \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550912)