Sciweavers

505 search results - page 5 / 101
» Implementation of Belief Change Operators Using BDDs
Sort
View
ECAI
2006
Springer
14 years 11 months ago
On the Logic of Theory Change: Relations Between Incision and Selection Functions
This work elaborates on the connection between partial meet contractions and kernel contractions in belief change theory. We present a way to define incision functions (used in ker...
Marcelo A. Falappa, Eduardo L. Fermé, Gabri...
ECAI
2008
Springer
14 years 11 months ago
A Formal Approach for RDF/S Ontology Evolution
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
George Konstantinidis, Giorgos Flouris, Grigoris A...
ECSQARU
2009
Springer
15 years 1 months ago
Using Transfinite Ordinal Conditional Functions
Abstract. Ordinal Conditional Functions (OCFs) are one of the predominant frameworks to define belief change operators. In his original paper Spohn defines OCFs as functions from t...
Sébastien Konieczny
AAAI
2008
14 years 12 months ago
Argument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
Martín O. Moguillansky, Nicolás D. R...
PLDI
2004
ACM
15 years 3 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren