154 search results - page 24 / 31 » PAC-Learnability of Determinate Logic Programs |
WLP
1997
Springer
14 years 1 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
CI
2000
13 years 9 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
Several formal languages have been proposed to encode privacy policies, ranging from the Platform for Privacy Preferences (P3P), intended for communicating privacy policies to con...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. Proof-carrying code (PCC) allows a code producer to associate to a program a machine-checkable proof of its safety. In the original approach to PCC, the safety policy inc...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...