9532 search results - page 132 / 1907 » Logic, Graphs, and Algorithms |
ITRUST
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Logic languages establish a formal framework to solve authorization and delegation conflicts. However, we consider that a visual representation is necessary since graphs...
FMCO
2003
Springer
15 years 4 months ago
2003
Springer
In this paper we discuss the question which properties of a formally verified component are preserved when the component is changed due to an adaption to a new use. More specific...
CADE
2012
Springer
13 years 1 months ago
2012
Springer
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
CAV
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Separation Logic consists of a Boolean combination of predicates of the form vi ≥ vj +c where c is a constant and vi, vj are variables of some ordered infinite type li...
131
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...