Sciweavers

552 search results - page 50 / 111
» Languages Modulo Normalization
Sort
View
DLT
2006
13 years 11 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...
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 9 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis
PPDP
2009
Springer
14 years 4 months ago
A declarative encoding of telecommunications feature subscription in SAT
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
Michael Codish, Samir Genaim, Peter J. Stuckey
DEXAW
2000
IEEE
113views Database» more  DEXAW 2000»
14 years 2 months ago
Error Types in the Computer-Aided Translation of Tourism Texts
In European-funded project MIS under the MLIS programme, the authors attempted a computer-driven translation package for tourism texts in 5 languages. It was believed such a packa...
James Milton, Anastasia Garbi
APLAS
2007
ACM
14 years 1 months ago
Polymorphic Delimited Continuations
Abstract. This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski...
Kenichi Asai, Yukiyoshi Kameyama