#### Filter Results:

#### Publication Year

1976

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Panos Rondogiannis, William W. Wadge
- ACM Trans. Comput. Log.
- 2005

We give a purely model-theoretic characterization of the semantics of logic programs with negation-as-failure allowed in clause bodies. In our semantics, the meaning of a program is, as in the classical case, the unique <i>minimum</i> model in a program-independent ordering. We use an expanded truth domain that has an uncountable linearly ordered set of… (More)

- William W. Wadge
- ISLP
- 1991

- Edward A. Ashcroft, William W. Wadge
- Commun. ACM
- 1977

Lucid is a formal system in which programs can be written and proofs of programs carried out. The proofs are particularly easy to follow and straightforward to produce because the statements in a Lucid program are simply axioms from which the proof proceeds by (almost) conventional logical reasoning, with the help of a few axioms and rules of inference for… (More)

- Edward A. Ashcroft, William W. Wadge
- SIAM J. Comput.
- 1976

Chronolog(Z) is a logic programming language based on a linear-time temporal logic with unbounded past and future. It is suitable for applications involving the notion of dynamic change such as modelling periodical changes, non-terminating computations and temporal databases. The declarative semantics of Chronolog(Z) programs are given in terms of temporal… (More)

- Maria Chowdhury, Alex Thomo, William W. Wadge
- AIAI
- 2009

In this paper, we propose a preference framework for information retrieval in which the user and the system administrator are enabled to express preference annotations on search keywords and document elements, respectively. Our framework is flexible and allows expressing preferences such as " A is infinitely more preferred than B, " which we capture by… (More)

- Ruchi Agarwal, William W. Wadge
- PLC
- 2005

- John Plaice, William W. Wadge
- IEEE Trans. Software Eng.
- 1993

We present a new approach to the control of versions of software and other hierarchically structured entities. Any part of a system, from the smallest component to a complete system, may exist in different versions. The set of all possible versions under the refinement relation forms a partial order (in fact, a lattice). The fact that version V approximates… (More)

- Panos Rondogiannis, William W. Wadge
- J. Funct. Program.
- 1999

In this paper we demonstrate that a broad class of higher-order functional programs can be transformed into semantically equivalent multidimensional intensional programs that contain only nullary variable definitions. The proposed algorithm systematically eliminates user-defined functions from the source program, by appropriately introducing context… (More)