The Complexity of Satisfiability for Fragments of CTL and CTL? 1 Arne Meiera Martin Mundhenkb Michael Thomasa Heribert Vollmera

Source URL: www.thi.uni-hannover.de

Speeding-up Non-Clausal Local Search for Propositional Satisfiability with Clause Learning Zbigniew Stachniak and Anton Belov ⋆ Department of Computer Science and Engineering, York University, Toronto, Canada {zbigniew

Source URL: anton.belov-mcdowell.com

2009 IEEE IEEE International International Symposium

Source URL: ect.bell-labs.com

• Computer network security
• Boolean algebra
• Binary decision diagram
• Iptables
• Firewall
• Stateful firewall
• DMZ
• Boolean satisfiability problem
• True quantified Boolean formula
• Netfilter
• Computer network
• Distributed firewall

Inference methods for a pseudo-Boolean satisfiability solver Heidi E. Dixon and Matthew L. Ginsberg CIRL 1269 University of Oregon Eugene, OR {dixon, ginsberg}@cirl.uoregon.edu

Source URL: www.cirl.uoregon.edu

SMT Workshop 2013 11th International Workshop on Satisfiability Modulo Theories Helsinki, Finland, July 8th and 9th, 2013 Affiliated with the 16th International Conference on Theory and Applications of Satisfiability Tes

Source URL: smt2013.fbk.eu

Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability Anton Belov and Zbigniew Stachniak Department of Computer Science and Engineering, York University, Toronto, Canada {anton

Source URL: anton.belov-mcdowell.com

PDF Document

Source URL: www.kroening.com

• Formal methods
• Logic in computer science
• Vienna Development Method
• Functional analysis
• General topology
• Wellfoundedness
• Satisfiability modulo theories
• First-order logic
• Constructible universe
• F-algebra
• Ordinal number
• Sequence

PDF Document

Source URL: www.kestrel.edu

• Mathematics
• Algebra
• Abstract algebra
• Boolean algebra
• Algebraic structures
• Constraint programming
• Electronic design automation
• Formal methods
• Boolean satisfiability problem
• DPLL algorithm
• Conjunctive normal form
• Propositional calculus

ON THE SATISFIABILITY PROBLEM FOR CLASSES OF STRUCTURES RELATED TO FINITE DIMENSIONAL VECTOR SPACES CHRISTIAN HERRMANN, YASUYUKI TSUKAMOTO, AND MARTIN ZIEGLER 1. Introduction

Source URL: www.cs.swansea.ac.uk

Satisfiability Advancements Enabled by State Machines A dissertation submitted to the Graduate School of the University of Cincinnati

Source URL: www.cs.uc.edu