Search Results

The relevance of polynomial classes of formulas to deductive efficiency motivated their further research, and currently, a great number of such classes is known. Nevertheless, they have been exclusively sought in the setting of ...

In recent years we have seen a number of satisfiability solvers emerge in the world of fuzzy propositional logics. However, only a few of them can solve product logic problems with the continuous product t-norm. The existing solvers may be ...$\mathrm{}$

The Exact Satisfiability problem asks if we can find a satisfying assignment to each clause such that exactly one literal in each clause is assigned 1, while the rest are all assigned 0. We can generalise this problem further by ...

The originality of this work resides into the exploitation of data mining techniques for problem solving. Two major phases define this work. The first one is to determine the clustering technique that best suits each SAT instance based ...

• Study of instances distribution to deduce the most appropriate clustering technique.

Design of Reversible logic gate enabled Reconfigurable Direct digital synthesizer is evaluated here. The need for Direct Digital Synthesizers (DDS) inherently finds application in the area of radio frequency communication. DDS is a method of ...

We developed a formal framework for conflict-driven clause learning (CDCL) using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL calculus is connected first to a more concrete calculus, then to a SAT solver expressed ...

A wide band fractional-N digital PLL which uses a high resolution 2-dimension gated-Vernier time-to-digital converter (TDC) with 5.2 ps resolution is presented. The quantization noise shaping of the TDC greatly improves the in-band phase noise. While, ...

SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T, are composed with logical connectives. The DPLL(T) approach to SMT has risen to prominence as a ...

We prove an exponential lower bound on the average time of inverting Goldreich's function by drunken backtracking algorithms; this resolves the open question stated in Cook et al. (Proceedings of TCC, pp. 521---538, 2009 ). The Goldreich's function ...

A novel flash fast-locking digital phase-locked loop (DPLL) is presented and behaviorally modeled using Verilog-AMS. The DPLL operation includes two stages: (1) a novel coarse-tuning stage for frequency tracking which employs a flash algorithm leading ...

We formalize a completeness proof for the DPLL proof system and extract a DPLL SAT solver from it. When applied to a propositional formula in conjunctive normal form the program produces either a satisfying assignment or a DPLL derivation which shows ...

A novel fast-locking DPLL based on the Successive-Approximation Register (SAR) is presented and modeled using SPICE. The DPLL has two distinct stages of operation: 1) A coarse-tuning stage which employs frequency tracking to bring the VCO and reference ...

This paper discusses a model of constraint satisfaction problems known as uniquely extendible constraint satisfaction problems. This model includes and generalizes XOR-SAT, and the model includes an NP-complete problem that appears to share many of the ...

Traditional PLL architecture uses one control voltage for both integrated and proportional part of the oscillator. Digital PLL architecture uses 2 control words for integrated and proportional part of the oscillator. In this paper, we describe a new ...

A novel flash fast-locking digital phase-locked loop (DPLL) is presented and behaviorally modeled. The DPLL operation includes two stages: (1) a novel coarse-tuning stage for frequency tracking which employs a flash algorithm similar to the one employed ...

In this work, we improve on existing results on the relationship between proof systems obtained from conflict-driven clause-learning SAT solvers and general resolution. Previous contributions such as those by Beame et al. (2004), Hertel et al. (2008), ...

Digital Signal Processing (DSP) system involves a wide spectrum of DSP algorithms for its realization and is often accelerated by use of novel VLSI design techniques. Now-a-days various DSP systems are implemented on a variety of programmable signal ...

A dual one-way ranging system (DOWR) can provide very high precision ranging between two carrier phase transceiver-receiver systems. In microwave ranging system, the accuracy of inter-satellite ranging is mainly limited by the stability of the ...

Satisfiability (SAT) solvers often benefit from transformations of the formula to be decided that allow them to do more through deduction and decrease their reliance on enumeration. For formulae in conjunctive normal form, subsumed clauses may be ...

We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause/cube learning, extending it to non-prenex instances. We call the resulting technique ...