Results 111 to 120 of about 18,245 (221)
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
A READER'S MAP: Human and machine intelligence, in memory of Daniel Kahneman
AI Magazine, Volume 47, Issue 4, Winter 2026.
Luis Lamb, Francesca Rossi
wiley +1 more source
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source
Data-Aware Hybrid Tableaux [PDF]
Logical Methods in Computer ScienceLabelled tableaux have been a traditional approach to define satisfiability checking procedures for Modal Logics. In many cases, they can also be used to obtain tight complexity bounds and lead to efficient implementations of reasoning tools.
Carlos Areces +2 more
doaj +1 more source
Satisfiability with Exponential Families [PDF]
, 2007 Fix a set S ⊆ {0, 1}* of exponential size, e.g. |S ∩ {0, 1}n| ∈ Ω(αn), α > 1. The S-SAT problem asks whether a propositional formula F over variables v1, . . . , vn has a satisfying assignment (v1, . . . , vn) ∈ {0, 1}n ∩ S. Our interest is in determining the complexity of S-SAT.
Dominik Scheder, Philipp Zumstein
openaire +1 more source
On the Satisfiability of Local First-Order Logics with Data [PDF]
Logical Methods in Computer ScienceWe study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality.
Benedikt Bollig +2 more
doaj +1 more source
A constructive investigation of satisfiability
, 2012 Wepresent a constructive analysis of the logical notions of satisfiability and consistency for first-order intuitionistic formulae. In particular, we use formal topology theory to provide a positive semantics for satisfiability.
CIRAULO, FRANCESCO, Francesco Ciraulo
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 +3 more
doaj +1 more source
Optimizing with minimum satisfiability
Artificial Intelligence, 2012 MinSAT is the problem of finding a truth assignment that minimizes the number of satisfied clauses in a CNF formula. When we distinguish between hard and soft clauses, and soft clauses have an associated weight, then the problem, called Weighted Partial MinSAT, consists in finding a truth assignment that satisfies all the hard clauses and minimizes the
Zhu, Zhu +3 more
openaire +3 more sources
, 1993 This paper defines a problem that we called "fuzzy satisfiability" or "ffi-satisfiability." It describes in mathematical terms the semantics of satisfying clauses and formulas using fuzzy logic, by converting a boolean formula into an
Sandra Sudarsky
core