Sciweavers

169 search results - page 27 / 34
» Semantic forgetting in answer set programming
Sort
View
EPIA
2005
Springer
14 years 1 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...
ANLP
1994
113views more  ANLP 1994»
13 years 8 months ago
Acquiring Knowledge From Encyclopedic Texts
A computational model for the acquisition of knowledge from encyclopedic texts is described. The model has been implemented in a program, called SNOWY, that reads unedited texts f...
Fernando Gomez, Richard D. Hull, Carlos Segami
ASP
2003
Springer
14 years 23 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...
AAAI
2004
13 years 9 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
JELIA
2010
Springer
13 years 6 months ago
The mcs-ie System for Explaining Inconsistency in Multi-Context Systems
The Multi-Context System Inconsistency Explainer allows for evaluation of semantics and explanation of inconsistencies in systems where heterogeneous knowledge bases are linked via...
Markus Bögl, Thomas Eiter, Michael Fink, Pete...