73 search results - page 3 / 15 » Optimizing Conditional Logic Reasoning within CoLoSS |
IDEAS
2002
IEEE
13 years 10 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
ALP
1990
Springer
13 years 9 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
CADE
2010
Springer
13 years 6 months ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Non-standard reasoning in Description Logics (DLs) comprises computing a Least Common Subsumer (LCS), a Concept Difference, a Concept Unifier, or an Interpolant Concept, to name a ...
DLOG
2003
13 years 7 months ago
2003
This paper presents an application of a DL reasoner to the optimization of an object-relational query language. Queries containing aggregate functions are difficult to optimize be...