Results 71 to 80 of about 12,229,216 (240)
Entropy of theK-Satisfiability Problem [PDF]
Physical Review Letters, 1996 Summary: The threshold behavior of the \(K\)-satisfiability problem is studied in the framework of the statistical mechanics of random diluted systems. We find that at the transition the entropy is finite and hence that the transition itself is due to the abrupt appearance of logical contradictions in all solutions and not to the progressive decreasing
Monasson, Rémi, Zecchina, Riccardo
openaire +3 more sources
Theoria, EarlyView.Abstract This paper argues for the significance of Kaplan's logic LD in two ways: first, by looking at how logic got along before we had LD, and second, by using it to bring out the similarity between David Hume's thesis that one cannot deduce claims about the future on the basis of premises only about the past, and the so‐called "essentiality" of the ...
Gillian Russell
wiley +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
, 2014 We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*.
A. David +7 more
core +6 more sources
(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English
Theoria, EarlyView.ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley +1 more source
The Complexity of Reasoning with FODD and GFODD [PDF]
, 2014 Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domains.
Hescott, Benjamin J., Khardon, Roni
core +3 more sources
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features [PDF]
Logical Methods in Computer ScienceWe investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC.
Bartosz Bednarczyk
doaj +1 more source
Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
IEEE Access, 2020 Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science.
Guangfu Wu +5 more
doaj +1 more source
Numerical solution-space analysis of satisfiability problems [PDF]
Physical Review E, 2010 The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to sample the solution space with uniform weight.
Mann, Alexander, Hartmann, Alexander K.
openaire +4 more sources