3134 search results - page 7 / 627 » Computing full disjunctions |
SAC
2008
ACM
13 years 9 months ago
2008
ACM
ICLP
2003
Springer
14 years 3 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
ACTA
2011
13 years 4 months ago
2011
ECOOPW
1998
Springer
14 years 2 months ago
1998
Springer
Security is a fundamental precondition for the acceptance of mobile agent systems. In this paper we discuss protocols to improve agent security by distributing critical data and o...
LPNMR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...