Results 101 to 110 of about 44,054 (190)

Satisfiability Modulo Theories

, 2009
Applications in artificial intelligence, formal verification, and other areas have greatly benefited from the recent advances in SAT. It is often the case, however, that applications in these fields require determining the satisfiability of formulas in more expressive logics such as first-order logic.
C. Barrett, Sebastiani, Roberto, S. Seshia, C. Tinelli   +3 more
openaire   +4 more sources

Model Checking Dynamic-Epistemic Spatial Logic [PDF]

, 2006
In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/
Mardare, Radu, Priami, Corrado
core  

Exhaustive enumeration unveils clustering and freezing in random 3-SAT

, 2008
We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction.
A. Montanari, C. H. Papadimitriou, D. Achlioptas, D. G. Mitchell, G. Semerjian, J. Chavas, John Ardelius, L. Kroc, Lenka Zdeborová, M. Mézard, P. Cheeseman, R. J. Bayardo, S. A. Cook, S. Seitz   +13 more
core   +1 more source

Ontology-Based Finite Satisfiability of UML Class Model

IEEE Access, 2018
Software models are core artifacts in model driven engineering (MDE) and processable by computer. They are automatically transformed into other models and in MDE, programming code is also produced by the models.
Abdul Hafeez Khan, Sayed Hyder Abbas Musavi, Aqeel-Ur Rehman, Asadullah Shaikh   +3 more
doaj   +1 more source

Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi [PDF]

Logical Methods in Computer Science
The 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

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures [PDF]

Logical Methods in Computer Science
We introduce the class of tree constraint automata with data values in Z (equipped with the less than relation and equality predicates to constants) and we show that the nonemptiness problem is ExpTime-complete.
Stephane Demri, Karin Quaas
doaj   +1 more source

Research on Abstraction-Based Search Space Partitioning and Solving Satisfiability Problems

Mathematics
Solving 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

On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories

, 2016
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories.
Lierler, Yuliya, Susman, Benjamin
core  

Artificial dragonfly algorithm in the Hopfield neural network for optimal Exact Boolean k satisfiability representation. [PDF]

PLoS One, 2023
Ali GA, Abubakar H, Alzaeemi SAS, Almawgani AHM, Sulaiman A, Tay KG.   +5 more
europepmc   +1 more source

Reweighted belief propagation and quiet planting for random K-SAT

, 2014
We study the random K-satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause.
Krzakala, Florent, Mézard, Marc, Zdeborová, Lenka   +2 more
core   +1 more source