Exploiting functional dependencies in declarative problem specifications

DOI10.1016/J.ARTINT.2007.04.017MaRDI QIDQ1028967zbMATH OpenOpenAlexFDO

Authors 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

modelingconstraint satisfaction problemsreformulationsecond-order logic

Mathematics Subject Classification ID

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

Recommendations

• Logics in Artificial Intelligence
• Constrained dependencies
• Detection and exploitation of functional dependencies for model generation
• Theory and Applications of Satisfiability Testing
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4123296 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 1142300 (Why is no real title available?)
• scientific article; zbMATH DE number 1538056 (Why is no real title available?)
• scientific article; zbMATH DE number 1759706 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• A theory of abstraction
• AI*IA 2005: Advances in Artificial Intelligence
• Automated reformulation of specifications by safe delay of constraints
• Compiling problem specifications into SAT
• Constraint satisfaction from a deductive viewpoint
• Existence of nontrivial solutions of certain linear and nonlinear convolution-type equations
• Increasing constraint propagation by redundant modeling: An experience report
• Logic programs with stable model semantics as a constraint programming paradigm
• Model theory.
• NP is as easy as detecting unique solutions
• Permutation Problems and Channelling Constraints
• The DLV system for knowledge representation and reasoning
• The complexity of Unique \(k\)-SAT: An isolation lemma for \(k\)-CNFs

Cited in

(6)

• scientific article; zbMATH DE number 1980921 (Why is no real title available?)
• Computer Aided Verification
• Evaluating ASP and commercial solvers on the CSPLib
• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 5811190 (Why is no real title available?)
• MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks

Describes a project that uses

Uses Software

• AMPL
• OTTER

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028967)