Sciweavers

210 search results - page 19 / 42
» Definability and automorphisms in abstract logics
Sort
View
COMMA
2008
13 years 9 months ago
Argument Theory Change: Revision Upon Warrant
Abstract. We propose an abstract argumentation theory whose dynamics is captured by the application of belief revision concepts. The theory is deemed as abstract because both the u...
Nicolás D. Rotstein, Martín O. Mogui...
COLING
2006
13 years 7 months ago
Geometry and Meaning
and logic defined on certain types of abstract spaces and how that intimate relationship might be exploited when applied in computational linguistics. It is also about an approach ...
C. J. van Rijsbergen
ICLP
1994
Springer
13 years 11 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
TWEB
2008
66views more  TWEB 2008»
13 years 7 months ago
An environment for flexible advanced compensations of Web service transactions
tions at runtime. We introduce the abstract service and adapter components which allow us to separate the compensation logic from the coordination logic. In this way, we can easily...
Michael Schäfer, Peter Dolog, Wolfgang Nejdl
AIML
2004
13 years 9 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou