Results 101 to 110 of about 44,520 (208)
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
Satisfiability Modulo Theory based Methodology for Floorplanning in VLSI Circuits
, 2017 This paper proposes a Satisfiability Modulo Theory based formulation for floorplanning in VLSI circuits. The proposed approach allows a number of fixed blocks to be placed within a layout region without overlapping and at the same time minimizing the ...
Banerjee, Suchandra +2 more
core +1 more source
A Case for Contingent Absurdity
European Journal of Philosophy, Volume 34, Issue 1, Page 266-280, March 2026.Abstract A popular view on existential absurdity holds that if life is absurd, it must be inescapably so. In opposition to this view, I argue that the concept of existential absurdity allows for life to be contingently absurd. In Nausea (1938) and Being and Nothingness (1943), Jean‐Paul Sartre puts forward two distinct conceptions of an absurd life ...
Thom Hamer
wiley +1 more source
A New General Method to Generate Random Modal Formulae for Testing Decision Procedures
, 2011 The recent emergence of heavily-optimized modal decision procedures has highlighted the key role of empirical testing in this domain. Unfortunately, the introduction of extensive empirical tests for modal logics is recent, and so far none of the proposed
Patel-Schneider, P. F., Sebastiani, R.
core +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
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
Some fragments of second-order logic over the reals for which satisfiability and equivalence are (un)decidable [PDF]
, 2014 We consider the Σ1 0-fragment of second-order logic over the vocabulary h+, ×, 0, 1,
Grimson, Rafael, Kuijpers, Bart
core +1 more source
Practical Reasoning for Very Expressive Description Logics
, 1999 Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones.
Horrocks, Ian +2 more
core +6 more sources
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
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