201 search results - page 20 / 41 » Merging Logic Programs under Answer Set Semantics |
101
Voted
AAAI
2008
15 years 2 months ago
2008
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...
134
Voted
ICLP
1994
Springer
15 years 3 months ago
1994
Springer
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...
104
Voted
IJCAI
2007
15 years 1 months ago
2007
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...
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
The problem of merging multiple sources information is central in many information processing areas such as databases integration problems, multiple criteria decision making, exper...
127
click to vote
JAIR
2007
14 years 11 months ago
2007
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...