Sciweavers

1331 search results - page 110 / 267
» Description logic reasoning using the PTTP approach
Sort
View
CADE
2008
Springer
16 years 6 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
CADE
2004
Springer
16 years 6 months ago
Dr.Doodle: A Diagrammatic Theorem Prover
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
Daniel Winterstein, Alan Bundy, Corin A. Gurr
KBSE
2006
IEEE
16 years 12 days ago
An Instant Message-Driven User Interface Framework for Thin Client Applications
Today, thin client applications often rely on the infrastructure of the WWW to deliver their user interfaces (UIs) to clients. While this approach does not require the deployment ...
Matthias Book, Volker Gruhn, Gerald Mucke
ECAI
1998
Springer
15 years 10 months ago
Probabilistic Logic Programming
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
Thomas Lukasiewicz
WOLLIC
2009
Springer
16 years 29 days ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos