Sciweavers

4488 search results - page 164 / 898
» Properties of NP-Complete Sets
Sort
View
JSAT
2006
73views more  JSAT 2006»
13 years 8 months ago
Impurity: Another Phase Transition of SAT
It is well known that satisfiability of random sets of propositional clauses undergoes phase transition while the clause-to-variable ratio of the sets increases. We introduce anot...
Eliezer L. Lozinskii
APAL
2005
135views more  APAL 2005»
13 years 8 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
ISCI
2002
106views more  ISCI 2002»
13 years 8 months ago
Neighborhood operator systems and approximations
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
Wei-Zhi Wu, Wen-Xiu Zhang
SAC
2010
ACM
14 years 3 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...
SEMWEB
2009
Springer
14 years 2 months ago
Mechanisms for Importing Modules
Abstract The current OWL 2 specification provides mechanisms for importing whole ontologies. This paper discusses the import of only a module of an external ontology, which is spe...
Bijan Parsia, Ulrike Sattler, Thomas Schneider