530 research outputs found
Deciding regular grammar logics with converse through first-order logic
We provide a simple translation of the satisfiability problem for regular
grammar logics with converse into GF2, which is the intersection of the guarded
fragment and the 2-variable fragment of first-order logic. This translation is
theoretically interesting because it translates modal logics with certain frame
conditions into first-order logic, without explicitly expressing the frame
conditions.
A consequence of the translation is that the general satisfiability problem
for regular grammar logics with converse is in EXPTIME. This extends a previous
result of the first author for grammar logics without converse. Using the same
method, we show how some other modal logics can be naturally translated into
GF2, including nominal tense logics and intuitionistic logic.
In our view, the results in this paper show that the natural first-order
fragment corresponding to regular grammar logics is simply GF2 without extra
machinery such as fixed point-operators.Comment: 34 page
Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases
Open Answer Set Programming (OASP) is an undecidable framework for
integrating ontologies and rules. Although several decidable fragments of OASP
have been identified, few reasoning procedures exist. In this article, we
provide a sound, complete, and terminating algorithm for satisfiability
checking w.r.t. Forest Logic Programs (FoLPs), a fragment of OASP where rules
have a tree shape and allow for inequality atoms and constants. The algorithm
establishes a decidability result for FoLPs. Although believed to be decidable,
so far only the decidability for two small subsets of FoLPs, local FoLPs and
acyclic FoLPs, has been shown. We further introduce f-hybrid knowledge bases, a
hybrid framework where \SHOQ{} knowledge bases and forest logic programs
co-exist, and we show that reasoning with such knowledge bases can be reduced
to reasoning with forest logic programs only. We note that f-hybrid knowledge
bases do not require the usual (weakly) DL-safety of the rule component,
providing thus a genuine alternative approach to current integration approaches
of ontologies and rules
Web ontology representation and reasoning via fragments of set theory
In this paper we use results from Computable Set Theory as a means to
represent and reason about description logics and rule languages for the
semantic web.
Specifically, we introduce the description logic \mathcal{DL}\langle
4LQS^R\rangle(\D)--admitting features such as min/max cardinality constructs
on the left-hand/right-hand side of inclusion axioms, role chain axioms, and
datatypes--which turns out to be quite expressive if compared with
\mathcal{SROIQ}(\D), the description logic underpinning the Web Ontology
Language OWL. Then we show that the consistency problem for
\mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is decidable by
reducing it, through a suitable translation process, to the satisfiability
problem of the stratified fragment of set theory, involving variables
of four sorts and a restricted form of quantification. We prove also that,
under suitable not very restrictive constraints, the consistency problem for
\mathcal{DL}\langle 4LQS^R\rangle(\D)-knowledge bases is
\textbf{NP}-complete. Finally, we provide a -translation of rules
belonging to the Semantic Web Rule Language (SWRL)
Type-elimination-based reasoning for the description logic SHIQbs using decision diagrams and disjunctive datalog
We propose a novel, type-elimination-based method for reasoning in the
description logic SHIQbs including DL-safe rules. To this end, we first
establish a knowledge compilation method converting the terminological part of
an ALCIb knowledge base into an ordered binary decision diagram (OBDD) which
represents a canonical model. This OBDD can in turn be transformed into
disjunctive Datalog and merged with the assertional part of the knowledge base
in order to perform combined reasoning. In order to leverage our technique for
full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that
preserves satisfiability and entailment of positive and negative ground facts.
The proposed technique is shown to be worst case optimal w.r.t. combined and
data complexity and easily admits extensions with ground conjunctive queries.Comment: 38 pages, 3 figures, camera ready version of paper accepted for
publication in Logical Methods in Computer Scienc
A Logic of Reachable Patterns in Linked Data-Structures
We define a new decidable logic for expressing and checking invariants of
programs that manipulate dynamically-allocated objects via pointers and
destructive pointer updates. The main feature of this logic is the ability to
limit the neighborhood of a node that is reachable via a regular expression
from a designated node. The logic is closed under boolean operations
(entailment, negation) and has a finite model property. The key technical
result is the proof of decidability. We show how to express precondition,
postconditions, and loop invariants for some interesting programs. It is also
possible to express properties such as disjointness of data-structures, and
low-level heap mutations. Moreover, our logic can express properties of
arbitrary data-structures and of an arbitrary number of pointer fields. The
latter provides a way to naturally specify postconditions that relate the
fields on entry to a procedure to the fields on exit. Therefore, it is possible
to use the logic to automatically prove partial correctness of programs
performing low-level heap mutations
Craig Interpolation for Decidable First-Order Fragments
We show that the guarded-negation fragment (GNFO) is, in a precise sense, the
smallest extension of the guarded fragment (GFO) with Craig interpolation. In
contrast, we show that the smallest extension of the two-variable fragment
(FO2), and of the forward fragment (FF) with Craig interpolation, is full
first-order logic. Similarly, we also show that all extensions of FO2 and of
the fluted fragment (FL) with Craig interpolation are undecidable.Comment: Submitted for FoSSaCS 2024. arXiv admin note: substantial text
overlap with arXiv:2304.0808
- …