Sciweavers

3032 search results - page 252 / 607
» Description Logic Rules
Sort
View
FUZZIEEE
2007
IEEE
15 years 11 months ago
Toward Multiple-agent Extensions of Possibilistic Logic
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
Didier Dubois, Henri Prade
CADE
2004
Springer
16 years 5 months ago
Sonic - Non-standard Inferences Go OilEd
Sonic1 is the first prototype implementation of non-standard inferences for Description Logics usable via a graphical user interface. The contribution of our implementation is twof...
Anni-Yasmin Turhan, Christian Kissig
LICS
1999
IEEE
15 years 9 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl
TAMODIA
2008
15 years 6 months ago
Preserving Rich User Interface State in Web Applications across Various Platforms
This paper aims to provide thorough discussion of the aspects that compose the state of a Web application user interface, and show how it can be preserved across multiple devices w...
Fabio Paternò, Carmen Santoro, Antonio Scor...
CSL
1999
Springer
15 years 9 months ago
A Road-Map on Complexity for Hybrid Logics
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
Carlos Areces, Patrick Blackburn, Maarten Marx