Sciweavers

634 search results - page 58 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
VLDB
2005
ACM
74views Database» more  VLDB 2005»
15 years 3 months ago
Designing Information-Preserving Mapping Schemes for XML
An XML-to-relational mapping scheme consists of a procedure for shredding XML documents into relational databases, a procedure for publishing databases back as documents, and a se...
Denilson Barbosa, Juliana Freire, Alberto O. Mende...
ISSAC
2004
Springer
185views Mathematics» more  ISSAC 2004»
15 years 3 months ago
Automatic generation of polynomial loop
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
Enric Rodríguez-Carbonell, Deepak Kapur
NMR
2004
Springer
15 years 3 months ago
A SAT-based polynomial space algorithm for answer set programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
CSFW
2003
IEEE
15 years 3 months ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
VISUALIZATION
1997
IEEE
15 years 2 months ago
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
Rüdiger Westermann, Thomas Ertl