Sciweavers

4 search results - page 1 / 1
» A Logic for Anytime Deduction and Anytime Compilation
Sort
View
JELIA
1998
Springer
13 years 8 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
CCIA
2009
Springer
13 years 5 months ago
Anytime Reasoning Mechanism for Conversational Agents
When an agent receives a query from another agent, it tries to satisfy it by building an answer based on its current knowledge. Depending on the available time or the urgency of t...
M. Mariela Morveli-Espinoza, Josep Puyol-Gruart
ISIPTA
2005
IEEE
137views Mathematics» more  ISIPTA 2005»
13 years 10 months ago
Basing Probabilistic Logic on Gambles
This article presents a probabilistic logic whose sentences can be interpreted as asserting the acceptability of gambles described in terms of an underlying logic. This probabilis...
Peter R. Gillett, Richard B. Scherl, Glenn Shafer
AIIA
1991
Springer
13 years 8 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf