Sciweavers

2432 search results - page 118 / 487
» Cryptographic logical relations
Sort
View
CSL
2003
Springer
15 years 5 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
85
Voted
ATAL
2006
Springer
15 years 4 months ago
TANDEM - a design method for integrating web services into multi-agent systems
This paper introduces a new design method for multi-agent systems (MAS) that incorporate logic programming. The DigitalFriend is an example of a MAS with a built-in logic language...
Steve Goschnick, Sandrine Balbo, Leon Sterling, Ch...
AMAI
2006
Springer
15 years 21 days ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
ENTCS
2008
101views more  ENTCS 2008»
15 years 21 days ago
Imperative LF Meta-Programming
Logical frameworks have enjoyed wide adoption as meta-languages for describing deductive systems. While the techniques for representing object languages in logical frameworks are ...
Aaron Stump
110
Voted
HOA
1993
15 years 4 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer