Sciweavers

284 search results - page 28 / 57
» On Reversible Combinatory Logic
Sort
View
ACL
1990
13 years 11 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
KR
2010
Springer
14 years 2 months ago
From Preference Logics to Preference Languages, and Back
Preference logics and AI preference representation languages are both concerned with reasoning about preferences on combinatorial domains, yet so far these two streams of research...
Meghyn Bienvenu, Jérôme Lang, Nic Wil...
APAL
2005
97views more  APAL 2005»
13 years 9 months ago
Polarized and focalized linear and classical proofs
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...
Olivier Laurent, Myriam Quatrini, Lorenzo Tortora ...
ITC
2003
IEEE
170views Hardware» more  ITC 2003»
14 years 3 months ago
Double-Tree Scan: A Novel Low-Power Scan-Path Architecture
In a scan-based system with a large number of flip-flops, a major component of power is consumed during scanshift and clocking operation in test mode. In this paper, a novel scan-...
Bhargab B. Bhattacharya, Sharad C. Seth, Sheng Zha...
FMCAD
2009
Springer
14 years 1 months ago
Generalized, efficient array decision procedures
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...