Sciweavers

201 search results - page 20 / 41
» Merging Logic Programs under Answer Set Semantics
Sort
View
AAAI
2008
13 years 11 months ago
Using Answer Set Programming and Lambda Calculus to Characterize Natural Language Sentences with Normatives and Exceptions
One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
Chitta Baral, Juraj Dzifcak, Tran Cao Son
ICLP
1994
Springer
14 years 21 days ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
IJCAI
2007
13 years 10 months ago
A New Perspective on Stable Models
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
ECAI
2000
Springer
14 years 29 days ago
Encoding Information Fusion in Possibilistic Logic: A General Framework for Rational Syntactic Merging
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, exper...
Salem Benferhat, Didier Dubois, Souhila Kaci, Henr...
JAIR
2007
108views more  JAIR 2007»
13 years 8 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen