Zobrazeno 1 - 10
of 738
pro vyhledávání: '"03b70"'
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
Autor:
Platzer, André
Publikováno v:
Formal Methods Teaching 2024
This invited paper is a passionate pitch for the significance of logic in scientific education. Logic helps focus on the essential core to identify the foundations of ideas and provides corresponding longevity with the resulting approach to new and o
Externí odkaz:
http://arxiv.org/abs/2407.09959
Generalised quantifiers, which include Henkin's branching quantifiers, have been introduced by Mostowski and Lindstr\"om and developed as a substantial topic application of logic, especially model theory, to linguistics with work by Barwise, Cooper,
Externí odkaz:
http://arxiv.org/abs/2407.09865
Autor:
Bezhanishvili, Nick, Bussi, Laura, Ciancia, Vincenzo, Fernández-Duque, David, Gabelaia, David
Polyhedral semantics is a recently introduced branch of spatial modal logic, in which modal formulas are interpreted as piecewise linear subsets of an Euclidean space. Polyhedral semantics for the basic modal language has already been well investigat
Externí odkaz:
http://arxiv.org/abs/2406.16056
Probabilistic Hoare logic (PHL) is an extension of Hoare logic and is specifically useful in verifying randomized programs. It allows researchers to formally reason about the behavior of programs with stochastic elements, ensuring the desired probabi
Externí odkaz:
http://arxiv.org/abs/2406.16054
Autor:
Koshkin, Sergiy
Publikováno v:
Logic Journal of the IGPL, 2023
We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate cal
Externí odkaz:
http://arxiv.org/abs/2406.14094