1486 search results - page 187 / 298 » A Logically Saturated Extension of |
168
click to vote
WEBNET
2001
15 years 7 months ago
2001
: This paper presents a method that automates hypermedia presentation generation on the Web. The method is based on RMM (Relationship Management Methodology) for aspects of hyperme...
141
Voted
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...
135
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...
161
Voted
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...
150
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...