Knowing Minimum/Maximum n Formulae 1 and Natasha Alechina 2 ˚ Thomas Agotnes Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at l

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Formal languages
• Logical truth
• Metalogic
• First-order logic
• Interpretation
• Substitution
• Well-formed formula
• Satisfiability

Satisfiability Solving for Program Verification: towards the Efficient Combination of Automated Theorem Provers and Satisfiability Modulo Theory Tools Silvio Ranise1,2 1

Source URL: www.loria.fr

Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems Silvio Ghilardi1 , Enrica Nicolini2 , Silvio Ranise2 , and Daniele Zucchelli1,2 1 Dipartimento di Informatica, Universit`

Source URL: www.loria.fr

Under consideration for publication in Theory and Practice of Logic Programming 1 Clingo = ASP + Control: Preliminary Report Martin Gebser1,2 , Roland Kaminski2 , Benjamin Kaufmann2 , and Torsten Schaub2 ∗

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Mathematical logic
• Constraint programming
• Logic in computer science
• Programming paradigms
• Satisfiability modulo theories
• Answer set programming
• Stable model semantics
• G-code
• Subroutine
• Analogy
• Algorithm

Polsat: A Portfolio LTL Satisfiability Solver Jianwen Li1 , Geguang Pu1 , Lijun Zhang2 , Yinbo Yao1 , Moshe Y. Vardi3 , and Jifeng He1 1 2

Source URL: www.lab205.org

BRICS DS-04-5 B. Skjernaa: Exact Algorithms for Variants of Satisfiability and Colouring Problems BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• NP-complete problems
• Boolean satisfiability problem
• NP-complete
• Satisfiability
• Maximum cut
• Algorithm
• Graph coloring
• 2-satisfiability
• Theoretical computer science
• Mathematics
• Applied mathematics

The Complexity of the Routing Problem in POR Wei Hu, Jin Xie, and Zhenghao Zhang Computer Science Department Florida State University Tallahassee, FL 32306, USA Abstract—We have designed and implemented a new protocol

Source URL: www.cs.fsu.edu

• Optimization problem
• Applied mathematics
• Constraint programming
• Theoretical computer science
• 2-satisfiability
• Mathematics

Beating the random assignment on constraint satisfaction problems of bounded degree Boaz Barak∗ arXiv:1505.03424v1 [cs.CC] 13 May 2015

Source URL: arxiv.org

• Mathematics
• MAX-3SAT
• Constraint satisfaction problem
• 2-satisfiability
• Constraint satisfaction
• Decomposition method
• Local consistency
• Constraint programming
• Theoretical computer science
• Applied mathematics

Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar∗ Konstantin Makarychev∗†

Source URL: konstantin.makarychev.net

• Operations research
• NP-complete problems
• Linear programming
• Real algebraic geometry
• Semidefinite programming
• 2-satisfiability
• Mathematical optimization
• Constraint satisfaction problem
• Constraint satisfaction
• Theoretical computer science
• Applied mathematics
• Computational complexity theory