2214 search results - page 139 / 443 » Complexity of Reasoning |
132
Voted
TABLEAUX
1999
Springer
15 years 7 months ago
1999
Springer
Appeared in: N.V. Murray, editor, Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX’99), Lecture Notes in Artificial Intelligence 1617, Springer, pages 2...
118
Voted
EWCBR
1998
Springer
15 years 7 months ago
1998
Springer
Development and maintenance of a case-base is known to be one of the most difficult problems in real-world application of case-based diagnosis systems. The complexity of large tech...
132
Voted
TIME
1997
IEEE
15 years 7 months ago
1997
IEEE
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, allows the derivation of the maximal validity intervals (MVIs) o...
113
click to vote
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
106
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...