500 research outputs found
Towards a Proof Theory of G\"odel Modal Logics
Analytic proof calculi are introduced for box and diamond fragments of basic
modal fuzzy logics that combine the Kripke semantics of modal logic K with the
many-valued semantics of G\"odel logic. The calculi are used to establish
completeness and complexity results for these fragments
Integrated Modeling and Verification of Real-Time Systems through Multiple Paradigms
Complex systems typically have many different parts and facets, with
different characteristics. In a multi-paradigm approach to modeling, formalisms
with different natures are used in combination to describe complementary parts
and aspects of the system. This can have a beneficial impact on the modeling
activity, as different paradigms an be better suited to describe different
aspects of the system. While each paradigm provides a different view on the
many facets of the system, it is of paramount importance that a coherent
comprehensive model emerges from the combination of the various partial
descriptions. In this paper we present a technique to model different aspects
of the same system with different formalisms, while keeping the various models
tightly integrated with one another. In addition, our approach leverages the
flexibility provided by a bounded satisfiability checker to encode the
verification problem of the integrated model in the propositional
satisfiability (SAT) problem; this allows users to carry out formal
verification activities both on the whole model and on parts thereof. The
effectiveness of the approach is illustrated through the example of a
monitoring system.Comment: 27 page
Temporal Data Modeling and Reasoning for Information Systems
Temporal knowledge representation and reasoning is a major research field in Artificial
Intelligence, in Database Systems, and in Web and Semantic Web research. The ability to
model and process time and calendar data is essential for many applications like appointment
scheduling, planning, Web services, temporal and active database systems, adaptive
Web applications, and mobile computing applications. This article aims at three complementary
goals. First, to provide with a general background in temporal data modeling
and reasoning approaches. Second, to serve as an orientation guide for further specific
reading. Third, to point to new application fields and research perspectives on temporal
knowledge representation and reasoning in the Web and Semantic Web
On Modal Logics of Partial Recursive Functions
The classical propositional logic is known to be sound and complete with
respect to the set semantics that interprets connectives as set operations. The
paper extends propositional language by a new binary modality that corresponds
to partial recursive function type constructor under the above interpretation.
The cases of deterministic and non-deterministic functions are considered and
for both of them semantically complete modal logics are described and
decidability of these logics is established
On modal expansions of left-continuous t-norm logics
The authors have been suported by the MINECO project TIN2012-39348-C02-01. Vidal has also been supported by the FWF/GACR project I1897-N25.Peer reviewe
On strongly standard complete fuzzy logics: and its expansions
Finding strongly standard complete axiomatizations for t-norm based fuzzy logics (i.e. complete for deductions with infinite sets of premises w.r.t. semantics on the real unit interval [0, 1]) is still an open problem in general, even though results are already available for some particular cases like some infinitary logics based on a continuous t-norm or certain expansions of Monoidal t-norm based logic (MTL) with rational constant symbols. In this paper we propose a new approach towards the problem of defining strongly standard complete for logics with rational constants in a simpler way. We present a method to obtain a Hilbert-Style axiomatization of the logic associated to an arbitrary standard MTL-algebra expanded with additional connectives whose interpretations on [0, 1] are functions with no jump-type discontinuities.Authors are grateful to anonymous reviewers and acknowledge partial support of the Mineco project TIN2012-39348-C02-01.Peer Reviewe
- ā¦