An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes
- URL: http://arxiv.org/abs/2310.12234v1
- Date: Wed, 18 Oct 2023 18:14:18 GMT
- Title: An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes
- Authors: Amar Shah, Federico Mora, Sanjit A. Seshia
- Abstract summary: Algebraic data types (ADTs) are a construct classically found in functional programming languages.
We present an SMT solver that takes a fundamentally different approach, an empheager approach.
- Score: 4.393684402895834
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Algebraic data types (ADTs) are a construct classically found in functional
programming languages that capture data structures like enumerated types,
lists, and trees. In recent years, interest in ADTs has increased. For example,
popular programming languages, like Python, have added support for ADTs.
Automated reasoning about ADTs can be done using satisfiability modulo theories
(SMT) solving, an extension of the Boolean satisfiability problem with
constraints over first-order structures. Unfortunately, SMT solvers that
support ADTs do not scale as state-of-the-art approaches all use variations of
the same \emph{lazy} approach. In this paper, we present an SMT solver that
takes a fundamentally different approach, an \emph{eager} approach.
Specifically, our solver reduces ADT queries to a simpler logical theory,
uninterpreted functions (UF), and then uses an existing solver on the reduced
query. We prove the soundness and completeness of our approach and demonstrate
that it outperforms the state-of-theart on existing benchmarks, as well as a
new, more challenging benchmark set from the planning domain.
Related papers
- To CoT or not to CoT? Chain-of-thought helps mainly on math and symbolic reasoning [55.52872152909785]
Chain-of-thought (CoT) via prompting is the de facto method for eliciting reasoning capabilities from large language models (LLMs)
We show that CoT gives strong performance benefits primarily on tasks involving math or logic, with much smaller gains on other types of tasks.
arXiv Detail & Related papers (2024-09-18T17:55:00Z) - Automata-based constraints for language model decoding [9.137697105669142]
Language models (LMs) are often expected to generate strings in some formal language.
tuning requires significant resources, making it impractical for uncommon or task-specific formats.
We solve these issues through the application of automata theory.
Our system compiles constraints 7,000x faster, is provably correct, and can be extended in a modular fashion.
arXiv Detail & Related papers (2024-07-11T00:25:01Z) - Top-Down Knowledge Compilation for Counting Modulo Theories [11.086759883832505]
Propositional model counting can be solved efficiently when the input formula is in deterministic decomposable negation normal form (d-DNNF)
Top-down knowledge compilation is a state-of-the-art technique for solving #SAT problems.
We advocate for a top-down compiler based on the traces of exhaustive DPLL(T) search.
arXiv Detail & Related papers (2023-06-07T15:46:28Z) - Evaluating and Improving Tool-Augmented Computation-Intensive Math
Reasoning [75.74103236299477]
Chain-of-thought prompting(CoT) and tool augmentation have been validated as effective practices for improving large language models.
We propose a new approach that can deliberate the reasoning steps with tool interfaces, namely textbfDELI.
Experimental results on CARP and six other datasets show that the proposed DELI mostly outperforms competitive baselines.
arXiv Detail & Related papers (2023-06-04T17:02:59Z) - SatLM: Satisfiability-Aided Language Models Using Declarative Prompting [68.40726892904286]
We propose a new satisfiability-aided language modeling (SatLM) approach for improving the reasoning capabilities of large language models (LLMs)
We use an LLM to generate a declarative task specification rather than an imperative program and leverage an off-the-shelf automated theorem prover to derive the final answer.
We evaluate SATLM on 8 different datasets and show that it consistently outperforms program-aided LMs in the imperative paradigm.
arXiv Detail & Related papers (2023-05-16T17:55:51Z) - Linear Temporal Logic Modulo Theories over Finite Traces (Extended
Version) [72.38188258853155]
This paper studies Linear Temporal Logic over Finite Traces (LTLf)
proposition letters are replaced with first-order formulas interpreted over arbitrary theories.
The resulting logic, called Satisfiability Modulo Theories (LTLfMT), is semi-decidable.
arXiv Detail & Related papers (2022-04-28T17:57:33Z) - Transformer-based Machine Learning for Fast SAT Solvers and Logic
Synthesis [63.53283025435107]
CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems.
In this work, we propose a one-shot model derived from the Transformer architecture to solve the MaxSAT problem.
arXiv Detail & Related papers (2021-07-15T04:47:35Z) - Text Modular Networks: Learning to Decompose Tasks in the Language of
Existing Models [61.480085460269514]
We propose a framework for building interpretable systems that learn to solve complex tasks by decomposing them into simpler ones solvable by existing models.
We use this framework to build ModularQA, a system that can answer multi-hop reasoning questions by decomposing them into sub-questions answerable by a neural factoid single-span QA model and a symbolic calculator.
arXiv Detail & Related papers (2020-09-01T23:45:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.