Sciweavers

DISOPT
2011
210views Education» more  DISOPT 2011»
12 years 11 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider
PKDD
2010
Springer
168views Data Mining» more  PKDD 2010»
13 years 2 months ago
Bayesian Knowledge Corroboration with Logical Rules and User Feedback
Current knowledge bases suffer from either low coverage or low accuracy. The underlying hypothesis of this work is that user feedback can greatly improve the quality of automatica...
Gjergji Kasneci, Jurgen Van Gael, Ralf Herbrich, T...
AML
2005
81views more  AML 2005»
13 years 4 months ago
A logical and algebraic treatment of conditional probability
This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part f...
Tommaso Flaminio, Franco Montagna
IJCAI
1993
13 years 5 months ago
Nonmonotonic Model Inference-A Formalization of Student Modeling
A student model description language and its synthesis method are presented. The language called SMDL is based on a logic programming language taking 4 truth values such as true, ...
Mitsuru Ikeda, Yasuyuki Kono, Riichiro Mizoguchi
FOIKS
2008
Springer
13 years 6 months ago
An Alternative Foundation for DeLP: Defeating Relations and Truth Values
Abstract. In this paper we recast the formalism of argumentation formalism known as DeLP (Defeasible Logic Programming) in game-theoretic terms. By considering a game between a Pro...
Ignacio D. Viglizzo, Fernando A. Tohmé, Gui...
LPNMR
1993
Springer
13 years 8 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
ECSQARU
2001
Springer
13 years 9 months ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu
FUZZIEEE
2007
IEEE
13 years 11 months ago
On Complete Sublattices of the Algebra of Truth Values of Type-2 Fuzzy Sets
— The algebra of truth values of type-2 fuzzy sets contains isomorphic copies of the algebra of truth values of type1 fuzzy sets and the algebra of truth values of interval-value...
John Harding, Carol L. Walker, Elbert A. Walker