Sciweavers

264 search results - page 14 / 53
» Negative Reasoning Using Inheritance
Sort
View
EPIA
2007
Springer
14 years 1 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, ...
JOCN
2011
67views more  JOCN 2011»
13 years 2 months ago
Reasoning with Exceptions: An Event-related Brain Potentials Study
■ Defeasible inferences are inferences that can be revised in the light of new information. Although defeasible inferences are pervasive in everyday communication, little is kno...
Judith Pijnacker, Bart Geurts, Michiel van Lambalg...
SEKE
1994
Springer
13 years 11 months ago
Rule firing with metarules
We describe a technique for the control of production rules firing in an object-oriented setting. This technique is based on the separation of control rules from ordinary domain r...
François Pachet, Jean-François Perro...
CL
2000
Springer
13 years 7 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
AAAI
2012
11 years 9 months ago
A Tractable First-Order Probabilistic Logic
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...
Pedro Domingos, William Austin Webb