Results 71 to 80 of about 1,567 (182)

The I in logic

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

ROBUSTNESS EVALUATION OF THE 3-SATISFIABILITY REVERSE ANALYSIS METHOD WITH DISCRETE HOPFIELD NEURAL NETWORK AND GENETIC ALGORITHM FOR TRAFFIC FLOW DATASET

Barekeng
Traffic flow congestion is a pervasive global phenomenon. Nonetheless, the systematic analysis and identification of traffic flow patterns remain a challenge as the volume of traffic data increases.
Amierah Abdul Malik, Mohd. Asyraf Mansor, Nur Ezlin Zamri, Nurul Atiqah Romli   +3 more
doaj   +1 more source

Classical and quantum satisfiability [PDF]

Electronic Proceedings in Theoretical Computer Science, 2012
We present the linear algebraic definition of QSAT and propose a direct logical characterization of such a definition. We then prove that this logical version of QSAT is not an extension of classical satisfiability problem (SAT).
Anderson de Araújo, Marcelo Finger
doaj   +1 more source

Is a More‐Than‐Minimal State the Meta‐Utopia?

Philosophy &Public Affairs, Volume 54, Issue 3, Page 203-212, Summer 2026.
ABSTRACT Part III of Anarchy, State, and Utopia defends the minimal state as a framework for utopia. On Bader's reconstruction, this defense contains two justificatory strands: a common ground argument, which shows the minimal state to be compatible with the widest range of utopian associations, and an approximation argument, which holds it to be the ...
Carlo Ludovico Cordasco
wiley   +1 more source

Complexity results for modal logic with recursion via translations and tableaux [PDF]

Logical Methods in Computer Science
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations
Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir   +4 more
doaj   +1 more source

R ( 5 , 5 ) ≤ 46

Journal of Graph Theory, Volume 112, Issue 3, Page 198-208, July 2026.
ABSTRACT We prove that the Ramsey number R ( 5 , 5 ) is less than or equal to 46. The proof uses a combination of linear programming and checking a large number of cases by computer. All of the computational parts of the proof were independently implemented by both authors, with consistent results.
Vigleik Angeltveit, Brendan D. McKay
wiley   +1 more source

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]

Logical Methods in Computer Science
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace ...
Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann   +3 more
doaj   +1 more source

LTLf satisfiability checking

CoRR, 2014
We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is based on a reduction to standard LTL satisfiability checking. We describe here a novel direct approach to LTLf satisfiability checking, where we take advantage of the ...
Jianwen Li, Lijun Zhang 0001, Geguang Pu, Moshe Y. Vardi, Jifeng He 0001   +4 more
openaire   +2 more sources

On the theories classified by an étendue

Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.
Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley   +1 more source

Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles

Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.
ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom, Emil Karlsson, Simin Nadjm‐Tehrani   +2 more
wiley   +1 more source