Sciweavers

2529 search results - page 114 / 506
» The Logical Structure of Binding
Sort
View
AAAI
1990
14 years 11 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
CADE
2010
Springer
14 years 11 months ago
Focused Inductive Theorem Proving
Abstract. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system ...
David Baelde, Dale Miller, Zachary Snow
ENTCS
2007
120views more  ENTCS 2007»
14 years 10 months ago
Local Reasoning about Data Update
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
SYNTHESE
2008
81views more  SYNTHESE 2008»
14 years 10 months ago
Adequate formalization
This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by d...
Michael Baumgartner, Timm Lampert
CORR
2010
Springer
255views Education» more  CORR 2010»
14 years 8 months ago
Multiplierless Modules for Forward and Backward Integer Wavelet Transform
: This article is about the architecture of a wavelet filter bank with reprogrammable logic. It is based on second generation of wavelets with a reduced of number of operations. A ...
Vasil Kolev