Sciweavers

3573 search results - page 182 / 715
» Reasoning about Codata
Sort
View
126
Voted
CADE
2001
Springer
16 years 3 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka
122
Voted
ECSQARU
2009
Springer
15 years 10 months ago
The Probabilistic Interpretation of Model-Based Diagnosis
Model-based diagnosis is the field of research concerned with the problem of finding faults ms by reasoning with abstract models of the systems. Typically, such models offer a ...
Ildikó Flesch, Peter J. F. Lucas
129
Voted
ESAW
2009
Springer
15 years 10 months ago
Programming Organization-Aware Agents
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
142
Voted
TIME
2007
IEEE
15 years 10 months ago
Temporalising Tractable Description Logics
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
Alessandro Artale, Roman Kontchakov, Carsten Lutz,...
145
Voted
CAV
2007
Springer
118views Hardware» more  CAV 2007»
15 years 9 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi