Sciweavers

845 search results - page 58 / 169
» Connecting Many-Sorted Theories
Sort
View
JCT
2008
120views more  JCT 2008»
14 years 11 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau
POPL
2010
ACM
15 years 9 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
CHI
2007
ACM
15 years 3 months ago
A familiar face(book): profile elements as signals in an online social network
Using data from a popular online social network site, this paper explores the relationship between profile structure (namely, which fields are completed) and number of friends, gi...
Cliff Lampe, Nicole Ellison, Charles Steinfield
IJCAI
1993
15 years 1 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
IANDC
2006
97views more  IANDC 2006»
14 years 12 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner