Sciweavers

2573 search results - page 200 / 515
» Combinations of Modal Logics
Sort
View
CSL
2003
Springer
15 years 11 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
ICLP
2003
Springer
15 years 11 months ago
Order and Negation as Failure
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
Davy Van Nieuwenborgh, Dirk Vermeir
CIC
2004
101views Communications» more  CIC 2004»
15 years 8 months ago
Lexicons in TIL and Verb Valency Frames
Abstract--The types of lexicons necessary for Transparent Intensional Logic (TIL) logical analysis will be described. We will show the algorithm for analysing the TIL verbal object...
Ales Horák, Karel Pala
ENTCS
2008
101views more  ENTCS 2008»
15 years 6 months 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
TGC
2007
Springer
16 years 19 days ago
Type-Safe Distributed Programming with ML5
Abstract We present ML5, a high level programming language for spatially distributed computing. The language, a variant of ML, allows an entire distributed application to be develo...
Tom Murphy VII, Karl Crary, Robert Harper