Oxford Index Browse

You are looking at 1-10 of 1,181 items for:

Computing x Logic x clear all

Refine by type

Refine by product

 

Abductive Analysis of Modular Logic Programs

ROBERTO GIACOBAZZI.

in Journal of Logic and Computation

August 1998; p ublished online August 1998 .

Journal Article. Subjects: Computing; Logic. 0 words.

We introduce a practical method for abductive analysis of modular logic programs. This is obtained by reversing the deduction process, which is usually applied in static-dataflow analysis...

Go to Oxford Journals »  abstract

About Folding–Unfolding Cuts and Cuts Modulo

Gilles Dowek.

in Journal of Logic and Computation

June 2001; p ublished online June 2001 .

Journal Article. Subjects: Computing; Logic. 0 words.

We show in this note that cut elimination in deduction modulo subsumes cut elimination in deduction with the folding and unfolding rules.

Go to Oxford Journals »  abstract

An abstract view on syntax with sharing

Richard Garner.

in Journal of Logic and Computation

December 2012; p ublished online September 2011 .

Journal Article. Subjects: Computing; Logic. 0 words.

The notion of term graph encodes a refinement of inductively generated syntax in which regard is paid to the the sharing and discard of subterms. Inductively generated syntax has an...

Go to Oxford Journals »  abstract

Abstraction and Ontology: Questions as Propositional Abstracts in Type Theory with Records

Jonathan Ginzburg.

in Journal of Logic and Computation

April 2005; p ublished online April 2005 .

Journal Article. Subjects: Computing; Logic. 0 words.

The paper develops a semantics for natural language interrogatives which identifies questions—the denotations of interrogatives—with propositional abstracts. The paper argues that a theory...

Go to Oxford Journals »  abstract

Achieving completeness in the verification of action theories by Bounded Model Checking in ASP

Laura Giordano, Alberto Martelli and Daniele Theseider Dupré.

in Journal of Logic and Computation

December 2015; p ublished online December 2013 .

Journal Article. Subjects: Computing; Logic. 0 words.

Temporal logics are well suited for reasoning about actions, as they allow for the specification of domain descriptions including temporal constraints as well as for the verification of...

Go to Oxford Journals »  home page

Ackermann's Implication for Typefree Logic

Klaus Robering.

in Journal of Logic and Computation

February 2001; p ublished online February 2001 .

Journal Article. Subjects: Computing; Logic. 0 words.

We study the positive fragment of a system of partial logic which has been developed by Ackermann in the course of his typefree foundation of mathematics. One of the prominent features of...

Go to Oxford Journals »  abstract

Acknowledgements

in Journal of Logic and Computation

December 2000; p ublished online December 2000 .

Journal Article. Subjects: Computing; Logic. 0 words.

Go to Oxford Journals »  abstract

Acknowledgements

in Journal of Logic and Computation

December 1997; p ublished online December 1997 .

Journal Article. Subjects: Computing; Logic. 0 words.

Go to Oxford Journals »  abstract

Acknowledgements

in Journal of Logic and Computation

December 1998; p ublished online December 1998 .

Journal Article. Subjects: Computing; Logic. 0 words.

Go to Oxford Journals »  abstract

Acknowledgements

in Journal of Logic and Computation

December 1999; p ublished online December 1999 .

Journal Article. Subjects: Computing; Logic. 0 words.

Go to Oxford Journals »  abstract