Natural domain SMT: a preliminary assessment

DOI10.1007/978-3-642-15297-9_8MaRDI QIDQ3588085zbMATH OpenOpenAlexFDO

Authors Scott Cotton

Publication date 10 September 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15297-9_8

Mathematics Subject Classification ID

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

Recommendations

• A survey of satisfiability modulo theory
• Satisfiability modulo theories
• An abstract interpretation of DPLL(T)
• Challenges in Satisfiability Modulo Theories
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)

Cited in

(9)

• Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs
• Semantically-guided goal-sensitive reasoning: model representation
• Deciding floating-point logic with abstract conflict driven clause learning
• Cutting to the chase. Solving linear integer arithmetic
• SAT-Based Model Checking
• A survey of satisfiability modulo theory
• On Natural Non-dcpo Domains
• Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
• Cutting to the chase.

Describes a project that uses

Uses Software

• Chaff
• SMT-LIB

This page was built for publication: Natural domain SMT: a preliminary assessment

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