Sciweavers

7123 search results - page 143 / 1425
» The Ordered Set of Rough Sets
Sort
View
ESA
2000
Springer
124views Algorithms» more  ESA 2000»
15 years 10 months ago
Higher Order Delaunay Triangulations
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
Joachim Gudmundsson, Mikael Hammar, Marc J. van Kr...
PUK
2000
15 years 7 months ago
On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas
The generation of the set of all ground actions for a given set of ADL operators, which are allowed to have conditional effects and preconditions that can be represented using arbi...
Jana Koehler, Jörg Hoffmann
CSL
2005
Springer
15 years 12 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé
JSAI
2005
Springer
15 years 12 months ago
On Generalization and Subsumption for Ordered Clauses
: In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that t...
Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Ma...
APAL
2004
111views more  APAL 2004»
15 years 6 months ago
Concept lattices and order in fuzzy logic
The theory of concept lattices (i.e. hierarchical structures of concepts in the sense of Port-Royal school) is approached from the point of view of fuzzy logic. The notions of par...
Radim Belohlávek