551 search results - page 18 / 111 » {log}: A Logic Programming Language with Finite Sets |
JAPLL
2007
13 years 7 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
IJCAI
1989
13 years 9 months ago
1989
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
FSS
2008
13 years 8 months ago
2008
In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has s...
LPNMR
2007
Springer
14 years 2 months ago
2007
Springer
We describe a new grounder system for logic programs under answer set semantics, called GrinGo. Our approach combines and extends techniques from the two primary grounding approach...
DALT
2005
Springer
14 years 1 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...