4573 search results - page 495 / 915 » Automated Reasoning |
139
click to vote
TPHOL
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
137
click to vote
ECSQARU
2003
Springer
15 years 10 months ago
2003
Springer
An overview is provided of recent developments in the use of latent class (LC) models in social science research. Special attention is paid to the application of LC analysis as a f...
142
click to vote
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract logic programming is about designing logic programming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expres...
123
click to vote
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Concurrency is an attractive property of a language to exploit multi-CPU hardware or perform multiple tasks concurrently. In recent years we see Prolog systems experiment...
127
click to vote
FORTE
2001
15 years 6 months ago
2001
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is defined; the semantics extends the (infinitely branching) standard semantics by giving meaning to da...