Results 21 to 30 of about 180 (170)
A Resolution Decision Procedure for the Guarded Fragment with Transitive Guards [PDF]
, 2004 We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obtain a decision procedure for the guarded fragment with transitive guards.
Kazakov, Y., de Nivelle, H.
openaire +5 more sources
Generalising KAT to Verify Weighted Computations
Scientific Annals of Computer Science, 2019 Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests.
Leandro Gomes +2 more
doaj +1 more source
Deciding the guarded fragments by resolution
Journal of Symbolic Computation, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Nivelle, H., de Rijke, M.
openaire +3 more sources
The Descriptive Complexity of Graph Neural Networks [PDF]
TheoretiCSWe analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those definable ...
Martin Grohe
doaj +1 more source
Querying Guarded Fragments via Resolution
CoRR, 2020 Answering Boolean conjunctive queries over the guarded fragment is decidable, however, as yet no practical decision procedure exists. Meanwhile, ordered resolution, as a practically oriented algorithm, is widely used in state-of-art modern theorem provers.
Sen Zheng 0001, Renate A. Schmidt
openaire +3 more sources
PROBABILISTIC ROLE MODELS AND THE GUARDED FRAGMENT [PDF]
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2006 We propose a uniform semantic framework for interpreting probabilistic concept subsumption and probabilistic role quantification through statistical sampling distributions. This general semantic principle serves as the foundation for the development of a probabilistic version of the guarded fragment of first-order logic.
openaire +2 more sources
Advanced Engineering Materials, EarlyView.Digitalizing electroplating requires both domain knowledge and interoperability. This work introduces PlatOn, a domain ontology for trivalent chromium plating and coating characterization, and a hybrid pipeline that aligns it to a mid‐level reference ontology by combining eight similarity metrics with language model reasoning. Expert‐validated mappings
Janik Harter +10 more
wiley +1 more source
Querying the Guarded Fragment with Transitivity
, 2013 We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory ϕ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration.
Georg Gottlob +2 more
openaire +3 more sources
Advanced Engineering Materials, EarlyView.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