ACM DL

Computational Logic (TOCL)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski, Volume 2 Issue 4, Oct. 2001

Editorial
Krzysztof R. Apt, Antonis C. Kakas, Fariba Sadri
Page: 431
DOI: 10.1145/383779.383823
This special issue of the ACM Transactions on Computational Logic (TOCL) is dedicated to Robert A. Kowalski, or as he is better known, to Bob Kowalski, on the occasion of his 60th birthday. Throughout his distinguished research career Bob has...

On knowledge-based programming with sensing in the situation calculus
Ray Reiter
Pages: 433-457
DOI: 10.1145/383779.383780
We consider a class of knowledge-based Golog programs with sense actions. These programs refer explicitly to an agent's knowledge, and are designed to execute on-line, and under a dynamic closed-world assumption on knowledge. On-line execution...

An extended transformation approach to inductive logic programming
Nada Lavrač, Peter A. Flach
Pages: 458-494
DOI: 10.1145/383779.383781
Inductive logic programming (ILP) is concerned with learning relational descriptions that typically have the form of logic programs. In a transformation approach, an ILP task is transformed into an equivalent learning task in a different...

Incremental execution of guarded theories
Giuseppe De Giacomo, Hector J. Levesque, Sebastian Sardiña
Pages: 495-525
DOI: 10.1145/383779.383782
When it comes to building controllers for robots or agents, high level programming languages like Golog and ConGolog offer a useful compromise between planning-based approaches and low-level robot programming....

Strongly equivalent logic programs
Vladimir Lifschitz, David Pearce, Agustín Valverde
Pages: 526-541
DOI: 10.1145/383779.383783
A logic program P1 is said to be equivalent to a logic program P2 in the sense of the answer set...

Verifying security protocols as planning in logic programming
Luigia Carlucci Aiello, Fabio Massacci
Pages: 542-580
DOI: 10.1145/383779.383785
We illustrate ALSP (Action Language for Security Protocol), a declarative executable specification language for planning attacks to security protocols. ALSP is based on logic programming with negation as...

A computational theory of normative positions
Marek Sergot
Pages: 581-622
DOI: 10.1145/383779.383786
The Kanger-Lindahl theory of normative positions attempts to use a combination of deontic logic (the logic of obligation and permission) and a logic of action/agency to give a formal account of obligations, duties, rights, and other complex...

Logic programming revisited: logic programs as inductive definitions
Marc Denecker, Maurice Bruynooghe, Victor Marek
Pages: 623-654
DOI: 10.1145/383779.383789
Logic programming has been introduced as programming in the Horn clause subset of first-order logic. This view breaks down for the negation as failure inference rule. To overcome the problem, one line of research has been to view a logic program...