977 search results - page 4 / 196 » Logic programming with infinite sets |
183
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
128
Voted
IJCAI
2007
15 years 3 months ago
2007
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
134
click to vote
AAAI
2012
13 years 4 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
112
Voted
FUIN
2010
14 years 11 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
135
click to vote
ASP
2001
Springer
15 years 5 months ago
2001
Springer
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...