4617 search results - page 877 / 924 » Automation of Diagrammatic Reasoning |
110
click to vote
WWW
2004
ACM
16 years 2 months ago
2004
ACM
The understanding of Semantic Web documents is built upon ontologies that define concepts and relationships of data. Hence, the correctness of ontologies is vital. Ontology reason...
196
click to vote
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...
134
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
Abstract This work studies the properties of finite automata recognizing vectors with real components, encoded positionally in a given integer numeration base. Such automata are us...
226
click to vote
POPL
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
120
click to vote
CADE
2007
Springer
16 years 2 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...