1391 search results - page 213 / 279 » Completeness of Neighbourhood Logic |
175
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
146
click to vote
ECAI
1998
Springer
15 years 9 months ago
1998
Springer
A well-known framework by Fagin, Halpern, Moses and Vardi models knowledge-based agents as \Interpreted Systems". In this paper we analyse a particular class of interpreted sy...
150
click to vote
AAAI
2008
15 years 8 months ago
2008
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
145
click to vote
DLOG
2007
15 years 8 months ago
2007
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
169
click to vote
FLAIRS
2007
15 years 8 months ago
2007
In this paper, we extend Moss and Parikh’s approach to reasoning about topological properties of knowledge. We turn that system in a spatio-temporal direction by successively ad...