Sciweavers

174 search results - page 26 / 35
» Learning to Reason with a Restricted View
Sort
View
ASP
2003
Springer
14 years 19 days ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LOGCOM
2007
115views more  LOGCOM 2007»
13 years 7 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
ISIPTA
2005
IEEE
125views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
Evidential modeling for pose estimation
Pose estimation involves reconstructing the configuration of a moving body from images sequences. In this paper we present a general framework for pose estimation of unknown obje...
Fabio Cuzzolin, Ruggero Frezza
JMLR
2010
145views more  JMLR 2010»
13 years 2 months ago
Event based text mining for integrated network construction
The scientific literature is a rich and challenging data source for research in systems biology, providing numerous interactions between biological entities. Text mining technique...
Yvan Saeys, Sofie Van Landeghem, Yves Van de Peer
AMAI
1999
Springer
13 years 7 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä