Sciweavers

134 search results - page 19 / 27
» Reversible logic for supercomputing
Sort
View
ACL
1994
13 years 11 months ago
A Hybrid Reasoning Model for Indirect Answers
This paper presents our implemented computational model for interpreting and generating indirect answers to Yes-No questions. Its main features are 1) a discourse-plan-based appro...
Nancy Green, Sandra Carberry
IJFCS
2006
132views more  IJFCS 2006»
13 years 9 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin
ENTCS
2007
87views more  ENTCS 2007»
13 years 9 months ago
Aspect-orientation For Revitalising Legacy Business Software
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
Kris De Schutter, Bram Adams
POPL
2008
ACM
14 years 10 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
CALCO
2005
Springer
85views Mathematics» more  CALCO 2005»
14 years 3 months ago
Using Proofs by Coinduction to Find "Traditional" Proofs
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
Clemens Grabmayer