Sciweavers

884 search results - page 43 / 177
» Using Nested Logic Programs for Answer Set Programming
Sort
View
ASP
2005
Springer
14 years 1 months ago
A Preliminary Report on Integrating of Answer Set and Constraint Solving
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
ASP
2005
Springer
14 years 1 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
ACL
1990
13 years 9 months ago
Multiple Underlying Systems: Translating User Requests into Programs to Produce Answers
A user may typically need to combine the strengths of more than one system in order to perform a task. In this paper, we describe a component of the Janus natural language interfa...
Robert J. Bobrow, Philip Resnik, Ralph M. Weisched...
SCCC
2005
IEEE
14 years 1 months ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....
AMAI
2006
Springer
13 years 7 months ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak