Sciweavers

4488 search results - page 21 / 898
» Properties of NP-Complete Sets
Sort
View
JUCS
2006
73views more  JUCS 2006»
13 years 7 months ago
Proving Properties for Behavioural Specifications with Term Observation
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...
Narjes Berregeb
RSCTC
2004
Springer
200views Fuzzy Logic» more  RSCTC 2004»
14 years 1 months ago
A Comparative Study of Formal Concept Analysis and Rough Set Theory in Data Analysis
The theory of rough sets and formal concept analysis are compared in a common framework based on formal contexts. Different concept lattices can be constructed. Formal concept ana...
Yiyu Yao
ATAL
2005
Springer
14 years 1 months ago
Specifying and Analysing Agent-Based Social Institutions Using Answer Set Programming
In this paper we discuss the use of the Answer Set Programming paradigm for representing and analysing specifications of agent-based institutions. We outline the features of insti...
Owen Cliffe, Marina De Vos, Julian A. Padget
DAM
1999
70views more  DAM 1999»
13 years 7 months ago
On Maximal Shadows of Members in Left-compressed Sets
Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999...
Rudolf Ahlswede, Zhen Zhang
EJC
2010
13 years 8 months ago
On graphs isomorphic to their neighbour and non-neighbour sets
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...
Przemyslaw Gordinowicz