3424 search results - page 234 / 685 » Automated Testing of Classes |
174
Voted
LOPSTR
1998
Springer
15 years 11 months ago
1998
Springer
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
165
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
165
click to vote
LICS
1990
IEEE
15 years 11 months ago
1990
IEEE
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
206
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...
196
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...