Sciweavers

121 search results - page 20 / 25
» Elimination of Negation in a Logical Framework
Sort
View
92
Voted
AMAI
2006
Springer
14 years 9 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
ICDT
2009
ACM
125views Database» more  ICDT 2009»
15 years 10 months ago
How big must complete XML query languages be?
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
Clemens Ley, Michael Benedikt
NECO
2007
108views more  NECO 2007»
14 years 9 months ago
Spike-Frequency Adapting Neural Ensembles: Beyond Mean Adaptation and Renewal Theories
We propose a Markov process model for spike-frequency adapting neural ensembles which synthesizes existing mean-adaptation approaches, population density methods, and inhomogeneou...
Eilif Mueller, Lars Buesing, Johannes Schemmel, Ka...
EPIA
2007
Springer
15 years 3 months ago
Towards Tractable Local Closed World Reasoning for the Semantic Web
Recently, the logics of minimal knowledge and negation as failure MKNF [12] was used to introduce hybrid MKNF knowledge bases [14], a powerful formalism for combining open and clos...
Matthias Knorr, José Júlio Alferes, ...
POPL
2002
ACM
15 years 9 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers