Results 81 to 90 of about 18,245 (221)

Tools are all you need

open access: yesAI Magazine, Volume 47, Issue 4, Winter 2026.
Abstract Even while AI based on large language models makes enormous advances, many AI researchers and pundits argue that it LLMs are an inadequate basis for AI because they do not support exact logical and probabilistic reasoning. I argue in response that LLMs can and are using tools to perform such normative reasoning, and thus are in face already ...
Henry Kautz
wiley   +1 more source

Counting workflow satisfiability with exclusion constraints based on backtracking tree-decomposition

open access: yesDianxin kexue, 2016
Workflow satisfiability(WS)concerns the issue of resource allocation under some access control policies. Counting all its solutions is advantaged to verify the robustness of a workflow to resource exceptions.
Zhinian ZHAI   +5 more
doaj   +2 more sources

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

open access: yesBarekeng
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   +3 more
doaj   +1 more source

Timed Context-Free Temporal Logics [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2018
The paper is focused on temporal logics for the description of the behaviour of real-time pushdown reactive systems. The paper is motivated to bridge tractable logics specialized for expressing separately dense-time real-time properties and context-free ...
Laura Bozzelli   +2 more
doaj   +1 more source

Parameterized Modal Satisfiability

open access: yesAlgorithmica, 2010
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of propositional variables v. To this end we study the modality depth, a natural measure which has appeared in the literature,
Antonis Achilleos   +2 more
openaire   +6 more sources

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

open access: yesJournal of Graph Theory, Volume 113, Issue 3, Page 411-427, November 2026.
ABSTRACT A (2‐dimensional) realisation of a graph G is a pair ( G , p ), where p maps the vertices of G to R 2. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that G is rigid if every generic realisation of G is rigid; otherwise, G is flexible. In this paper, we investigate
Katie Clinch   +5 more
wiley   +1 more source

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

open access: yesLogical 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   +4 more
doaj   +1 more source

Formalization and Validation of Safety-Critical Requirements [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
The validation of requirements is a fundamental step in the development process of safety-critical systems. In safety critical applications such as aerospace, avionics and railways, the use of formal methods is of paramount importance both for ...
Alessandro Cimatti   +3 more
doaj   +1 more source

Leveraging Symbolic Artificial Intelligence and Fuzzy Logic for Materials Science: A Review of Methods, Challenges, and Applications to Scarce and Imperfect Experimental Data

open access: yesAdvanced Engineering Materials, Volume 28, Issue 20, 21 October 2026.
This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani   +7 more
wiley   +1 more source

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

open access: yesLogical 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   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy