245 search results - page 10 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
123
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. The interest in the area of non-monotonic reasoning and declarative logic programming is growing rapidly after the recent development of a number of Answer Set Programmin...
133
click to vote
AAAI
2006
15 years 3 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
106
Voted
AMAI
2006
Springer
15 years 1 months ago
2006
Springer
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
117
click to vote
ESOP
2009
Springer
15 years 5 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
132
click to vote
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...