atalog: A logic language for expressing search and optimization problems

DOI10.1017/S1471068409990251zbMath1191.68150WikidataQ62047427 ScholiaQ62047427MaRDI QIDQ3550912

Sergio Greco, Ester Zumpano, Cristian Molinaro, Irina Trubitsyna

Publication date: 7 April 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

Optimization Programming Language

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (3)

Using linear constraints for logic program termination analysis ⋮ NP Datalog ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Why not negation by fixpoint?
• Optimization, approximation, and complexity classes
• The expressive powers of stable models for bound and unbound DATALOG queries
• Extending and implementing the stable model semantics
• Approximation properties of NP minimization classes
• The expressive powers of the logic programming semantics
• Compiling problem specifications into SAT
• NP-SPEC: an executable specification language for solving all problems in NP
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Greedy algorithms in Datalog
• Predicate-calculus-based logics for modeling and solving search problems
• The DLV system for knowledge representation and reasoning

This page was built for publication: atalog: A logic language for expressing search and optimization problems