Sciweavers

34 search results - page 6 / 7
» The Representational Power of Conjunctive Normal Form
Sort
View
99
Voted
JFP
2007
111views more  JFP 2007»
14 years 9 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
111
Voted
ICDT
2011
ACM
242views Database» more  ICDT 2011»
14 years 28 days ago
Knowledge compilation meets database theory: compiling queries to decision diagrams
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
Abhay Kumar Jha, Dan Suciu
DAGSTUHL
2010
14 years 11 months ago
Local and Global Illumination in the Volume Rendering Integral
This article is intended as an update of the major survey by Max [40] on optical models for direct volume rendering. It provides a brief overview of the subject scope covered by [...
Nelson Max, Min Chen
VMCAI
2004
Springer
15 years 2 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
LICS
2002
IEEE
15 years 2 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin