Sciweavers

393 search results - page 49 / 79
» Logic Programs with Classical Negation
Sort
View
DLT
2006
13 years 10 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
JAPLL
2010
124views more  JAPLL 2010»
13 years 7 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
TC
2002
13 years 8 months ago
A Number System with Continuous Valued Digits and Modulo Arithmetic
This paper presents a novel number system based on signed continuous valued digits. Arithmetic operations in this number system are performed using simple analog circuitry, in con...
Aryan Saed, Majid Ahmadi, Graham A. Jullien
ICFP
2009
ACM
14 years 9 months ago
Non-parametric parametricity
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
Georg Neis, Derek Dreyer, Andreas Rossberg
SCAI
2001
13 years 10 months ago
Meaning and Partiality Revised
Muskens presents in Meaning and Partiality a semantics of possibly contradictory beliefs and other propositional attitudes. We propose a different partial logic based on a few key...
Jørgen Villadsen