Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is unsatisfiable once they have learned enough theory conflicts to derive a propositional contradiction. However some problems, such as the diamonds problem, requir...

In this paper, we present a new framework for combining complete and incomplete methods in order to deal with the Max Sat problem. The objective is to find the best assignment for a set of Boolean variables, which gives the maximum of verified clauses in a Boolean formula. Unfortunately, this problem has been shown to be NP-hard (non-deterministic polynomial-time hard) if the number of variable...

In this paper we propose parallel loop filter (LPF) and Number Controlled Oscillator (NCO) of carrier tracking loop in all-digital parallel receiver (APRX), according to the theoretical derivation of LPF and NCO in serial receiver. The Monte Carlo simulation results show that, the acquisition time, phase error response performance and tracking range of parallel LPF and NCO are better than that ...

The Model-Constructing Satisfiability Calculus (mcSAT) is a recently proposed generalization of propositional DPLL/CDCL for reasoning modulo theories. In contrast to most DPLL(T)-based SMT solvers, which carry out conflict-driven learning only on the propositional level, mcSAT calculi can also synthesise new theory literals during learning, resulting in a simple yet very flexible framework for ...

1 Tsinghua National Laboratory for Information Science and Technology (TNList), Beijing 100084, China 2 School of Software, Tsinghua University, Beijing 100084, China 3 Key Laboratory for Information System Security, MOE, Beijing 100084, China 4Department of Computer Science and Technologies, Tsinghua University, Beijing 100084, China 5 Institute of Information Science, Academia Sinica, Taipei ...

We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from the IPC-5 benchmarks. Satplan makes several calls to a SAT solver, discarding learned information with each call. Our planner uses a single call to a SAT solver, eliminating this problem. We explain our technique by des...

Great progress has been made on DPLL based SAT solvers operating on CNF encoded SAT theories. However, for most problems CNF is not a very natural representation. Typically these problems are more easily expressed using unrestricted propositional formulae and hence must be converted to CNF before modern SAT solvers can be applied. This conversion entails a considerable loss of information about...

Over the years, proof systems for propositional satisfiability (SAT) have been extensively studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been gaining attention. Q-resolution is a calculus enabling producing proofs from DPLL-based QBF solvers. While DPLL has become a dominating technique for SAT, QBF has been tackled by other complementary and competitive appr...