Sciweavers

658 search results - page 65 / 132
» A Logic for Graphs with QoS
Sort
View
PODS
1991
ACM
98views Database» more  PODS 1991»
14 years 8 days ago
Minimum and Maximum Predicates in Logic Programming
A novel approach is proposed for ezpresaing and computing eficienily a large cla88 of problem8, including jinding the shortest path in a graph, that were previously considered imp...
Sumit Ganguly, Sergio Greco, Carlo Zaniolo
WWW
2005
ACM
14 years 9 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
LOPSTR
2004
Springer
14 years 2 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
ICCS
2010
Springer
13 years 7 months ago
Default Conceptual Graph Rules, Atomic Negation and Tic-Tac-Toe
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
Jean-François Baget, Jérôme Fo...