Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Merging Relational Database Technology with Constraint Technology
Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Information and Computation - Special issue: LICS'97
Resolution decision procedures
Handbook of automated reasoning
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Lemma learning in the model evolution calculus
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using datalog with binary decision diagrams for program analysis
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Bounded model checking with QBF
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Geometric resolution: a proof procedure based on finite model search
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Efficient symbolic automated analysis of administrative attribute-based RBAC-policies
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Model checking using SMT and theory of lists
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Automated symbolic analysis of ARBAC-policies
STM'10 Proceedings of the 6th international conference on Security and trust management
On the verification of security-aware E-services
Journal of Symbolic Computation
CDCL-based abstract state transition system for coherent logic
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
EPR-based bounded model checking at word level
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
A framework for testing first-order logic axioms in program verification
Software Quality Control
Effectively-Propositional reasoning about reachability in linked data structures
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Modular reasoning about heap paths via effectively propositional formulas
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Hi-index | 0.00 |
We introduce a DPLL calculus that is a decision procedure for the Bernays-Schönfinkel class, also known as EPR. Our calculus allows combining techniques for efficient propositional search with data-structures, such as Binary Decision Diagrams, that can efficiently and succinctly encode finite sets of substitutions and operations on these. In the calculus, clauses comprise of a sequence of literals together with a finite set of substitutions; truth assignments are also represented using substitution sets. The calculus works directly at the level of sets, and admits performing simultaneous constraint propagation and decisions, resulting in potentially exponential speedups over existing approaches.