#### Filter Results:

- Full text PDF available (66)

#### Publication Year

1971

2016

- This year (0)
- Last 5 years (9)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Robert A. Kowalski, Marek J. Sergot
- New Generation Computing
- 1985

We outline an approach for reasoning about events and time within a logic programming framework. The notion of event is taken to be more primitive than that of time and both are represented explicitly by means of Horn clauses augmented with negation by failure. The main intended applications are the updating of databases and narrative understanding. In… (More)

- Andrei Bondarenko, Phan Minh Dung, Robert A. Kowalski, Francesca Toni
- Artif. Intell.
- 1997

We present an abstract framework for default reasoning, which includes Theorist, default logic, logic programming, autoepistemic logic, non-monotonic modal logics, and certain instances of circumscription as special cases. The framework can be understood as a gener-alisation of Theorist. The generalisation allows any theory formulated in a monotonic logic… (More)

- M. H. van Emden, Robert A. Kowalski
- J. ACM
- 1976

Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics… (More)

- Robert A. Kowalski
- The computer science library : Artificial…
- 1979

The infancy of a programming language can be a trying period for all involved. The developers of the language and the early followers are usually fiercely dedicated to demonstrating they they have achieved a major accomplishment. They become a vocal and adamant elite, willing to testify with evangelical fervor that they have finally discovered the Royal… (More)

- A C Kakas, R A Kowalski, F Toni
- 1998

This paper is a survey and critical overview of recent work on the extension of Logic Programming to perform Abductive Reasoning (Abductive Logic Programming). It updates the earlier paper \Abductive Logic Programming" 88]. We outline the general framework of Abduction and its applications to Knowledge Assimilation and Default Reasoning; we describe the… (More)

- Marek J. Sergot, Fariba Sadri, Robert A. Kowalski, F. Kriwaczek, Peter Hammond, H. T. Cory
- Commun. ACM
- 1986

The formalization of legislation and the development of computer systems to assist with legal problem solving provide a rich domain for developing and testing artificial-intelligence technology.

- Tze Ho Fung, Robert A. Kowalski
- J. Log. Program.
- 1997

- Robert A. Kowalski, Fariba Sadri
- Annals of Mathematics and Artificial Intelligence
- 1999

In this paper we present an extension of logic programming (LP) that is suitable not only for the “rational” component of a single agent but also for the “reactive” component and that can encompass multi‐agent systems. We modify an earlier abductive proof procedure and embed it within an agent cycle. The proof procedure incorporates abduction, definitions… (More)

- DOV M. GABBAY, Michael J. O'Donnell, A. C. Kakas, R. A. Kowalski
- Handbook of Logic in Artificial Intelligence and…
- 1994

- Robert A. Kowalski, Donald Kuehner
- Artif. Intell.
- 1971

Linear resolution with selection function (SL.resolution) is a restricted form of linear resolution. The main restriction is e~ected by a selection function which chooses fro:~ each clause a sit, gle literal to be resolved upon in that clause. This and other restrictions are adapted to linear resolution from Loveland's model elimination. We show that… (More)