4617 search results - page 771 / 924 » Automation of Diagrammatic Reasoning |
195
click to vote
CADE
2010
Springer
15 years 6 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
203
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
209
click to vote
ER
2010
Springer
15 years 5 months ago
2010
Springer
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
207
click to vote
FSS
2010
15 years 4 months ago
2010
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
187
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...