Sciweavers

39 search results - page 6 / 8
» Formalising Generalised Substitutions
Sort
View
LPNMR
1993
Springer
13 years 11 months ago
An Assumption-Based Framework for Non-Monotonic Reasoning
The notion of assumption-based framework generalises and re nes the use of abduction to give a formalisation of non-monotonic reasoning. In this framework, a sentence is a non-mon...
Andrei Bondarenko, Francesca Toni, Robert A. Kowal...
EACL
1989
ACL Anthology
13 years 8 months ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
AMAST
2000
Springer
14 years 13 hour ago
Behavioural Subtyping Relations for Object-Oriented Formalisms
In this paper we investigate the object-oriented notion of subtyping in the context of behavioural formalisms. Subtyping in OOformalisms is closely related to the concept of inheri...
Clemens Fischer, Heike Wehrheim
IJFCS
2007
93views more  IJFCS 2007»
13 years 7 months ago
Modelling and Analysis of PKI-Based Systems Using Process Calculi
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...
Benjamin Aziz, Geoff Hamilton
CADE
2006
Springer
14 years 8 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