3481 search results - page 272 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
145
click to vote
ATAL
2000
Springer
15 years 8 months ago
2000
Springer
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
159
click to vote
JSS
2006
15 years 4 months ago
2006
Web and peer-to-peer systems have emerged as popular areas in distributed computing, and their integrated usage permits the benefits of both to be exploited. While much work in th...
137
click to vote
IJCAI
2001
15 years 5 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
152
click to vote
SPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...
136
Voted
AAECC
1999
Springer
15 years 4 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...