Sciweavers

764 search results - page 27 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
EATCS
2000
108views more  EATCS 2000»
13 years 8 months ago
The Underlying Logic of Hoare Logic
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
Andreas Blass, Yuri Gurevich
IPPS
1998
IEEE
14 years 10 days ago
On the Automatic Validation of Parameterized Unity Programs
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Jean-Paul Bodeveix, Mamoun Filali
RR
2010
Springer
13 years 6 months ago
On the Semantic Relationship between Datalog and Description Logics
Translations to (first-order) datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities o...
Markus Krötzsch, Sebastian Rudolph, Peter H. ...
CLIMA
2007
13 years 9 months ago
EVOLP: Tranformation-Based Semantics
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
Martin Slota, João Leite
ICALP
2004
Springer
14 years 1 months ago
On the Expressive Power of Monadic Least Fixed Point Logic
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
Nicole Schweikardt