Sciweavers

3244 search results - page 40 / 649
» Extensions to Description Logics
Sort
View
CADE
2009
Springer
14 years 3 months ago
System Description: H-PILoT
Carsten Ihlemann, Viorica Sofronie-Stokkermans
FUZZIEEE
2007
IEEE
14 years 5 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
CSL
2010
Springer
13 years 11 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CSL
2000
Springer
14 years 3 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath
POPL
2010
ACM
14 years 1 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...