Exploiting functional dependencies in declarative problem specifications

DOI10.1016/j.artint.2007.04.017zbMath1168.68552OpenAlexW2039733104MaRDI QIDQ1028967

Toni Mancini, Marco Cadoli

Publication date: 9 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.04.017

zbMATH Keywords

modelingsecond-order logicconstraint satisfaction problemsreformulation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* ⋮ Evaluating ASP and commercial solvers on the CSPLib

Uses Software

• OTTER
• AMPL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NP is as easy as detecting unique solutions
• Constraint satisfaction from a deductive viewpoint
• Model theory.
• A theory of abstraction
• Increasing constraint propagation by redundant modeling: An experience report
• Logic programs with stable model semantics as a constraint programming paradigm
• Automated reformulation of specifications by safe delay of constraints
• Compiling problem specifications into SAT
• The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs
• Permutation Problems and Channelling Constraints
• The DLV system for knowledge representation and reasoning
• AI*IA 2005: Advances in Artificial Intelligence
• Existence of nontrivial solutions of certain linear and nonlinear convolution-type equations

This page was built for publication: Exploiting functional dependencies in declarative problem specifications