3244 search results - page 416 / 649 » Extensions to Description Logics |
149
click to vote
IJCAI
1989
15 years 7 months ago
1989
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
147
click to vote
ENTCS
2008
15 years 6 months ago
2008
Graphs are among the most frequently used structures in Computer Science. In this work, we analyze how we can express some important graph properties such as connectivity, acyclic...
182
click to vote
FMSD
2006
15 years 6 months ago
2006
A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL. Interactio...
156
click to vote
SYNTHESE
2008
15 years 6 months ago
2008
Objective Bayesian probability is often defined over rather simple domains, e.g., finite event spaces or propositional languages. This paper investigates the extension of objectiv...
173
click to vote
LOGCOM
1998
15 years 6 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...