4066 search results - page 300 / 814 » Almost Complete Sets |
180
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
173
Voted
CADE
2008
Springer
15 years 8 months ago
2008
Springer
We describe the new software package Aligator for automatically inferring polynomial loop invariants. The package combines algorithms from symbolic summation and polynomial algebra...
177
click to vote
CJCDGCGT
2005
Springer
15 years 8 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
186
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
In this paper we introduce a unified framework for topological manipulation on triangulated 2-manifolds with or without boundary. We show that there are two kinds of primitive oper...
170
click to vote
FOSSACS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...