Results 61 to 70 of about 71,669 (311)
A sequent calculus for propositional temporal logic with time gaps
A sequent calculus with Kripke semantics internalization for a propositional temporal logic with time gaps is introduced. All rules of the calculus are context-free and height-preserving invertible. Structural rules are admissible.
Romas Alonderis
doaj +1 more source
Specification Mining over Temporal Data
Current specification mining algorithms for temporal data rely on exhaustive search approaches, which become detrimental in real data settings where a plethora of distinct temporal behaviours are recorded over prolonged observations.
Giacomo Bergami +2 more
doaj +1 more source
The community‐driven Platform MaterialDigital Core Ontology (PMDco) 3.0 is introduced as a Basic Formal Ontology‐aligned semantic backbone for the processing–structure–properties paradigm in Materials Science and Engineering. Modular engineering, automated releases, and validation workflows are highlighted and key semantic patterns for materials ...
Markus Schilling +15 more
wiley +1 more source
Reasoning about XML with temporal logics and automata [PDF]
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of programs Many properties of interest in the XML context are related to ...
Leonid Libkin +3 more
core +1 more source
Logical foundations and implementation of an extension of temporal logic
The need of counting with the appropiate management of situations involving time an the motion of change, has been reconized as an important aspect in many Computer Science areas.
María Laura Cobo, Juan Carlos Augusto
doaj
Formalism-Driven Development: Concepts, Taxonomy, and Practice
Formal methods are crucial in program specification and verification. Instead of building cases to test functionalities, formal methods specify functionalities as properties and mathematically prove them. Nevertheless, the applicability of formal methods
Yepeng Ding, Hiroyuki Sato
doaj +1 more source
An all‐in‐one analog AI accelerator is presented, enabling on‐chip training, weight retention, and long‐term inference acceleration. It leverages a BEOL‐integrated CMO/HfOx ReRAM array with low‐voltage operation (<1.5 V), multi‐bit capability over 32 states, low programming noise (10 nS), and near‐ideal weight transfer.
Donato Francesco Falcone +11 more
wiley +1 more source
Encoding of Planning Problems and Their Optimizations in Linear Logic [PDF]
Girard’s Linear Logic is a formalism which can be used to manage a lot of problems with consumable resources. Its expressiveness is quite good for an easily understandable encoding of many problems.
Chrpa, Lukáš +5 more
core +1 more source
Teaching Formal Models of Concurrency Specification and Analysis
There is a widespread and rapidly growing interest to the parallel programming nowadays. This interest is based on availability of supercomputers, computer clusters and powerful graphic processors for computational mathematics and simulation. MPI, OpenMP,
N. V. Shilov
doaj +1 more source
Mean-Payoff Games with ω-Regular Specifications
Multi-player mean-payoff games are a natural formalism for modelling the behaviour of concurrent and multi-agent systems with self-interested players.
Julian Gutierrez +2 more
doaj +1 more source

