2490 search results - page 191 / 498 » Complexity of Contextual Reasoning |
137
Voted
KR
1998
Springer
15 years 9 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
144
click to vote
TIME
1997
IEEE
15 years 9 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...
130
Voted
ICLP
1997
Springer
15 years 9 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...
121
Voted
ICLP
1997
Springer
15 years 9 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...
163
click to vote
LOPSTR
1997
Springer
15 years 9 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...