Sciweavers

1247 search results - page 90 / 250
» Reasoning about Function Objects
Sort
View
111
Voted
CADE
2006
Springer
16 years 2 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
118
Voted
ESAW
2009
Springer
15 years 9 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...
DLOG
2007
15 years 5 months ago
Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
Vitaliy L. Khizder, David Toman, Grant E. Weddell
109
Voted
ECSQARU
2009
Springer
15 years 9 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
119
Voted
LPAR
2004
Springer
15 years 8 months ago
Evaluating QBFs via Symbolic Skolemization
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
Marco Benedetti