1,959 research outputs found
Grafting Hypersequents onto Nested Sequents
We introduce a new Gentzen-style framework of grafted hypersequents that
combines the formalism of nested sequents with that of hypersequents. To
illustrate the potential of the framework, we present novel calculi for the
modal logics and , as well as for extensions of the
modal logics and with the axiom for shift
reflexivity. The latter of these extensions is also known as
in the context of deontic logic. All our calculi enjoy syntactic cut
elimination and can be used in backwards proof search procedures of optimal
complexity. The tableaufication of the calculi for and
yields simplified prefixed tableau calculi for these logic
reminiscent of the simplified tableau system for , which might be
of independent interest
A Semantic Similarity Measure for Expressive Description Logics
A totally semantic measure is presented which is able to calculate a
similarity value between concept descriptions and also between concept
description and individual or between individuals expressed in an expressive
description logic. It is applicable on symbolic descriptions although it uses a
numeric approach for the calculus. Considering that Description Logics stand as
the theoretic framework for the ontological knowledge representation and
reasoning, the proposed measure can be effectively used for agglomerative and
divisional clustering task applied to the semantic web domain.Comment: 13 pages, Appeared at CILC 2005, Convegno Italiano di Logica
Computazionale also available at
http://www.disp.uniroma2.it/CILC2005/downloads/papers/15.dAmato_CILC05.pd
Exploring the focus-morphology interface: morpho-syntactic aspects of non prosodic focus : Selected Proceedings of the 2007 Mid American Linguistics Conference
This paper claims that a constraint-based theory (i.e, OT) can best account for the many manifestations of Focus in typologically diverse languages. We propose an interaction between Discourse Representation Theory (hereafter DRT) (Kamp, 1981; Kamp and Reyle, 1993) and Optimality Theory (OT) (Prince and Smolensky, 1993/2004) to best account for these facts, maintaining that constraint-ranking is the best way to achieve a descriptive and explanatorily adequate analysis of natural data. In particular, we provide a novel sketch of a theoretical account of natural languages that mark Focus morphologically but not prosodicall
On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics
We consider two styles of proof calculi for a family of tense logics,
presented in a formalism based on nested sequents. A nested sequent can be seen
as a tree of traditional single-sided sequents. Our first style of calculi is
what we call "shallow calculi", where inference rules are only applied at the
root node in a nested sequent. Our shallow calculi are extensions of Kashima's
calculus for tense logic and share an essential characteristic with display
calculi, namely, the presence of structural rules called "display postulates".
Shallow calculi enjoy a simple cut elimination procedure, but are unsuitable
for proof search due to the presence of display postulates and other structural
rules. The second style of calculi uses deep-inference, whereby inference rules
can be applied at any node in a nested sequent. We show that, for a range of
extensions of tense logic, the two styles of calculi are equivalent, and there
is a natural proof theoretic correspondence between display postulates and deep
inference. The deep inference calculi enjoy the subformula property and have no
display postulates or other structural rules, making them a better framework
for proof search
Automated Synthesis of Tableau Calculi
This paper presents a method for synthesising sound and complete tableau
calculi. Given a specification of the formal semantics of a logic, the method
generates a set of tableau inference rules that can then be used to reason
within the logic. The method guarantees that the generated rules form a
calculus which is sound and constructively complete. If the logic can be shown
to admit finite filtration with respect to a well-defined first-order semantics
then adding a general blocking mechanism provides a terminating tableau
calculus. The process of generating tableau rules can be completely automated
and produces, together with the blocking mechanism, an automated procedure for
generating tableau decision procedures. For illustration we show the
workability of the approach for a description logic with transitive roles and
propositional intuitionistic logic.Comment: 32 page
- …