Sciweavers

248 search results - page 27 / 50
» Circuit-based Boolean Reasoning
Sort
View
LICS
2007
IEEE
14 years 3 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
VL
2000
IEEE
140views Visual Languages» more  VL 2000»
14 years 1 months ago
Tabular and Textual Methods for Selecting Objects from a Group
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This paper studies the ways that untrained users naturall...
John F. Pane, Brad A. Myers
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
ENTCS
2006
113views more  ENTCS 2006»
13 years 9 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
CL
2000
Springer
14 years 1 months ago
Modelling Digital Circuits Problems with Set Constraints
A number of diagnostic and optimisation problems in Electronics Computer Aided Design have usually been handled either by specific tools or by mapping them into a general problem s...
Francisco Azevedo, Pedro Barahona