Sciweavers

552 search results - page 48 / 111
» Languages Modulo Normalization
Sort
View
117
Voted
CP
2005
Springer
15 years 7 months ago
Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Carsten Sinz
ASWC
2006
Springer
15 years 5 months ago
Transformation from OWL Description to Resource Space Model
Abstract. Semantics shows diversity in real world, document world, mental abstraction world and machine world. Transformation between semantics pursues the uniformity in the divers...
Hai Zhuge, Peng Shi, Yunpeng Xing, Chao He
CLIMA
2007
15 years 3 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
ICFP
2010
ACM
15 years 2 months ago
Lolliproc: to concurrency from classical linear logic via curry-howard and control
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
Karl Mazurak, Steve Zdancewic
TLCA
2009
Springer
15 years 8 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann