Image de couverture de livre

Expressiveness of SHACL Features and Extensions for Full Equality and Disjointness Tests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bogaerts, Bart, Jakubowski, Maxime, Bussche, Jan Van den
Format:	Preprint
Publié:	2022
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Preservation theorems for Tarski's relation algebra
par: Bogaerts, Bart, et autres
Publié: (2023)

Executable First-Order Queries in the Logic of Information Flows
par: Aamer, Heba, et autres
Publié: (2022)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
par: Van Caudenberg, Daimy, et autres
Publié: (2025)

Certified Branch-and-Bound MaxSAT Solving (Extended Version)
par: Vandesande, Dieter, et autres
Publié: (2025)

Recursive querying of neural networks via weighted structures
par: Grohe, Martin, et autres
Publié: (2026)

A Logical View of GNN-Style Computation and the Role of Activation Functions
par: Barceló, Pablo, et autres
Publié: (2025)

Halting Recurrent GNNs and the Graded $μ$-Calculus
par: Bollen, Jeroen, et autres
Publié: (2025)

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory
par: Pollaci, Samuele, et autres
Publié: (2024)

Approximation Fixpoint Theory with Refined Approximation Spaces
par: Vanbesien, Linde, et autres
Publié: (2025)

Static Analysis of Recursive SHACL
par: Oudshoorn, Anouk, et autres
Publié: (2026)

Characterizing Sets of Theories That Can Be Disjointly Combined
par: Przybocki, Benjamin, et autres
Publié: (2025)

SHACL Validation in the Presence of Ontologies: Semantics and Rewriting Techniques
par: Oudshoorn, Anouk, et autres
Publié: (2025)

Query languages for neural networks
par: Grohe, Martin, et autres
Publié: (2024)

Simulating dynamic systems using Linear Time Calculus theories
par: Bogaerts, Bart, et autres
Publié: (2014)

Disjoint Partial Enumeration without Blocking Clauses
par: Spallitta, Giuseppe, et autres
Publié: (2023)

Expressivity of AuDaLa: Turing Completeness and Possible Extensions
par: Franken, Tom T. P., et autres
Publié: (2024)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
par: Spallitta, Giuseppe, et autres
Publié: (2024)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
par: Lyon, Tim S., et autres
Publié: (2026)

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
par: Schirrmacher, Nicole, et autres
Publié: (2023)

From Shapes to Shapes: Inferring SHACL Shapes for Results of SPARQL CONSTRUCT Queries (Extended Version)
par: Seifer, Philipp, et autres
Publié: (2024)

Testing Uniform Random Samplers: Methods, Datasets and Protocols
par: Zeyen, Olivier, et autres
Publié: (2025)

Common Foundations for Recursive Shape Languages
par: Ahmetaj, Shqiponja, et autres
Publié: (2026)

Enriching Ontologies with Disjointness Axioms using Large Language Models
par: Crum, Elias, et autres
Publié: (2024)

An Expressive Coalgebraic Modal Logic for Cellular Automata
par: Basold, Henning, et autres
Publié: (2025)

Expressiveness Results for Timed Modal Mu-Calculi
par: Cleaveland, Rance, et autres
Publié: (2023)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
par: Wang, Shanxia
Publié: (2026)

Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification
par: Meseguer, Jose
Publié: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2023)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Expressive Quantale-valued Logics for Coalgebras: an Adjunction-based Approach
par: Beohar, Harsh, et autres
Publié: (2023)

About the Expressive Power and Complexity of Order-Invariance with Two Variables
par: Bednarczyk, Bartosz, et autres
Publié: (2023)

A Remark on the Expressivity of Asynchronous TeamLTL and HyperLTL
par: Kontinen, Juha, et autres
Publié: (2024)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
par: Mählmann, Nikolas
Publié: (2025)

Extensional Taylor Expansion
par: Blondeau-Patissier, Lison, et autres
Publié: (2023)

Concrete Domains Meet Expressive Cardinality Restrictions in Description Logics (Extended Version)
par: Baader, Franz, et autres
Publié: (2025)

Drawing with Distance
par: Jacobs, Bart
Publié: (2024)

On the Expressivity of Typed Concurrent Calculi
par: Paulus, Joseph William Neal
Publié: (2024)

Pseudo-Boolean d-DNNF Compilation for Expressive Feature Modeling Constructs
par: Sundermann, Chico, et autres
Publié: (2025)

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features
par: Bednarczyk, Bartosz
Publié: (2023)