1950 search results - page 202 / 390 » Lambda-Free Logical Frameworks |
178
click to vote
AAAI
2007
15 years 9 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
186
click to vote
TPHOL
1998
IEEE
15 years 11 months ago
1998
IEEE
We show how extensible records with structural subtyping can be represented directly in Higher-Order Logic (HOL). Exploiting some specific properties of HOL, this encoding turns o...
209
click to vote
HIM
1997
Springer
15 years 10 months ago
1997
Springer
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
186
click to vote
BIRTHDAY
2006
Springer
15 years 10 months ago
2006
Springer
The paper presents an approach to reasoning about Web services in a temporal action theory. Web services are described by specifying their interaction protocols in an action theory...
147
click to vote
IFIPTCS
2000
15 years 10 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...