Zobrazeno 1 - 10
of 1 124
pro vyhledávání: '"03b70"'
Autor:
Japaridze, Giorgi
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new approach
Externí odkaz:
http://arxiv.org/abs/2411.01393
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is currently missing.
Externí odkaz:
http://arxiv.org/abs/2410.14460
Autor:
Platzer, André, Qian, Long
This article proves the completeness of an axiomatization for initial value problems (IVPs) with compact initial conditions and compact time horizons for bounded open safety, open liveness and existence properties. Completeness systematically reduces
Externí odkaz:
http://arxiv.org/abs/2410.13836
Autor:
Koponen, Vera, Tousinejad, Yasmin
We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of children of a
Externí odkaz:
http://arxiv.org/abs/2410.11775
Mission-time Linear Temporal Logic (MLTL) is rapidly increasing in popularity as a specification logic, e.g., for runtime verification, model checking, and other formal methods, driving a need for a larger tool base for analysis of this logic. To tha
Externí odkaz:
http://arxiv.org/abs/2410.03465
Autor:
Lopez, Aliaume
A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet, Dou\'eneau-T
Externí odkaz:
http://arxiv.org/abs/2409.07882
Autor:
Guo, Xiangyu, Bansal, Ajay
We improve the backward compatibility of stableKanren to run miniKanren programs. stableKanren is a miniKanren extension capable of non-monotonic reasoning through stable model semantics. However, standard miniKanren programs that produce infinite re
Externí odkaz:
http://arxiv.org/abs/2408.16257
Autor:
Guo, Xiangyu, Bansal, Ajay
We integrate integrity constraints to stableKanren to enable a new problem-solving paradigm in combinatorial search problems. stableKanren extends miniKanren to reasoning about contradictions under stable model semantics. However, writing programs to
Externí odkaz:
http://arxiv.org/abs/2408.16699
Graph neural networks (GNNs) are frequently used to predict missing facts in knowledge graphs (KGs). Motivated by the lack of explainability for the outputs of these models, recent work has aimed to explain their predictions using Datalog, a widely u
Externí odkaz:
http://arxiv.org/abs/2408.10261
Autor:
Barbero, Fausto
We prove two (strong) undefinability results for logics based on inquisitive semantics (or its variant, team semantics). Namely: 1) we show the undefinability of intuitionistic implication in extended propositional inquisitive logic with tensor; 2) w
Externí odkaz:
http://arxiv.org/abs/2407.20889