Results 121 to 130 of about 18,245 (221)
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi [PDF]
Logical Methods in Computer ScienceThe coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based.
Daniel Hausmann, Lutz Schröder
doaj +1 more source
Renormalization group approach to satisfiability
, 2007 Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical ORs of these ...
S. N. Coppersmith
core +1 more source
Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems
MathematicsSolving satisfiability problems is central to many areas of computer science, including artificial intelligence and optimization. Efficiently solving satisfiability problems requires exploring vast search spaces, where search space partitioning plays a ...
Yuexin Huang, Qinzhou Niu, Yanfang Song
doaj +1 more source
Membrane Algorithms for Propositional Satisfiability
, 2001 Membrane algorithms for propositional satisfiability are ...
MANCA, Vincenzo
core +1 more source
Satisfiability modulo theories
, 2011 Checking the satisfiability of logical formulas, SMT solvers scale orders of magnitude beyond custom ad hoc solvers.
Leonardo De Moura, Nikolaj Bjørner
core +1 more source
Boolean Satisfiability: Theory and Engineering
, 2019 Since 2014, several leading theoreticians and experimentalists conducting research on Boolean satisfiability (SAT) solving have been meeting annually to stimulate an increased exchange of ideas between these two communities.
Vardi, Moshe
core +1 more source
Solving satisfiability in less than 2n steps
, 1985 In this paper we describe and analyse an algorithm for solving the satisfiability problem. If E is a boolean formula in conjunctive normal form with n variables and r clauses, then we will show that this algorithm solves the satisfiability problem for ...
Monien, B., Speckenmeyer, E.
core +1 more source
Satisfiability of XPath Expressions [PDF]
, 2004 In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem.
openaire +3 more sources
Generating Hard Satisfiability Problems
, 1995 We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy.
Hector J. Levesque +3 more
core +1 more source
Approximation Algorithms for Satisfiable and Nearly Satisfiable Ordering CSPs
Proceedings of the 58th Annual ACM Symposium on Theory of ComputingWe study approximation algorithms for satisfiable and nearly satisfiable instances of ordering constraint satisfaction problems (ordering CSPs). Ordering CSPs arise naturally in ranking and scheduling, yet their approximability remains poorly understood beyond a few isolated cases.
openaire +3 more sources