Sciweavers

204 search results - page 33 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
WWW
2005
ACM
14 years 8 months ago
OWL DL vs. OWL flight: conceptual modeling and reasoning for the semantic Web
The Semantic Web languages RDFS and OWL have been around for some time now. However, the presence of these languages has not brought the breakthrough of the Semantic Web the creat...
Axel Polleres, Dieter Fensel, Jos de Bruijn, Rub&e...
ECSQARU
1999
Springer
13 years 12 months ago
Nonmonotonic and Paraconsistent Reasoning: From Basic Entailments to Plausible Relations
In this paper we develop frameworks for logical systems which are able to re ect not only nonmonotonic patterns of reasoning, but also paraconsistent reasoning. For this we conside...
Ofer Arieli, Arnon Avron
DIAGRAMS
2004
Springer
14 years 29 days ago
Drawing Graphs in Euler Diagrams
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
Paul Mutton, Peter Rodgers, Jean Flower
FMCAD
2008
Springer
13 years 9 months ago
Automatic Non-Interference Lemmas for Parameterized Model Checking
Parameterized model checking refers to any method that extends traditional, finite-state model checking to handle systems arbitrary number of processes. One popular approach to thi...
Jesse D. Bingham
ESOP
2004
Springer
14 years 29 days ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn