Sciweavers

275 search results - page 37 / 55
» A Family of Defeasible Reasoning Logics and its Implementati...
Sort
View
TPLP
2002
117views more  TPLP 2002»
13 years 7 months ago
On Properties of Update Sequences Based on Causal Rejection
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
Thomas Eiter, Michael Fink, Giuliana Sabbatini, Ha...
MFCS
1995
Springer
13 years 11 months ago
An Abstract Account of Composition
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...
Martín Abadi, Stephan Merz
ICLP
1997
Springer
13 years 11 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
SEMWEB
2010
Springer
13 years 5 months ago
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Abstract. The Rule Interchange Format Production Rule Dialect (RIFPRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operation...
Carlos Viegas Damásio, José Jú...
CADE
2008
Springer
14 years 7 months ago
Certifying a Tree Automata Completion Checker
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
Benoît Boyer, Thomas Genet, Thomas P. Jensen