ECAI
1998
Springer
13 years 11 months ago
1998
Springer
A well-known framework by Fagin, Halpern, Moses and Vardi models knowledge-based agents as \Interpreted Systems". In this paper we analyse a particular class of interpreted sy...
ECAI
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
CP
2000
Springer
13 years 11 months ago
2000
Springer
The ability to reduce either the number of variables or clauses in instances of the Satisfiability problem (SAT) impacts the expected computational effort of solving a given instan...
CP
2000
Springer
13 years 11 months ago
2000
Springer
CP
2000
Springer
13 years 11 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
CP
2000
Springer
13 years 11 months ago
2000
Springer
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
AUSAI
1998
Springer
13 years 11 months ago
1998
Springer
Naive Bayesian classi ers utilise a simple mathematical model for induction. While it is known that the assumptions on which this model is based are frequently violated, the predic...
APN
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Workflow management technology promises a flexible solution facilitating the easy creation of new business processes and modification of existing ones. Unfortunately, mos...
APN
2000
Springer
13 years 11 months ago
2000
Springer
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
AMAI
2000
Springer
13 years 11 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...