Sciweavers

38 search results - page 3 / 8
» On a Logical Foundation for Explicit Substitutions
Sort
View
CADE
2006
Springer
14 years 7 months ago
Dynamic Logic with Non-rigid Functions
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
Bernhard Beckert, André Platzer
JAIR
2008
126views more  JAIR 2008»
13 years 7 months ago
Extended RDF as a Semantic Foundation of Rule Markup Languages
Ontologies and automated reasoning are the building blocks of the Semantic Web initiative. Derivation rules can be included in an ontology to define derived concepts based on base...
Anastasia Analyti, Grigoris Antoniou, Carlos Viega...
EUROMICRO
2009
IEEE
14 years 2 months ago
Foundations for a Model-Driven Integration of Business Services in a Safety-Critical Application Domain
—Current architectures for systems integration provide means for forming agile business processes by manually or dynamically configuring the components. However, a major challeng...
Richard Mordinyi, Thomas Moser, eva Kühn, Ste...
FOSSACS
2010
Springer
14 years 2 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson
TLCA
2001
Springer
13 years 11 months ago
Strong Normalisation for a Gentzen-like Cut-Elimination Procedure
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
Christian Urban