#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming languages for intuitionistic logic in the (single-conclusioned) sequent calculus LJ, but has subsequently been adapted to multiple-conclusioned systems such as those for linear logic. Given… (More)

Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. We brieey review the main problems, which are questions that are still elusive in the design of logic programming languages, from a proof-theoretic point of view. Existing approaches and… (More)

- Tatjana Lutovac, James Harland
- TABLEAUX
- 2005

- Tatjana Lutovac, James Harland
- Electr. Notes Theor. Comput. Sci.
- 2005

- Tatjana Lutovac, James Harland
- J. Log. Comput.
- 2006

- Tatjana Lutovac, James Harland
- Comput. Sci. Inf. Syst.
- 2013

Many important results in proof theory for sequent calculus (cut-elimination, completeness and other properties of search strategies, etc) are proved using permutations of sequent rules. The focus of this paper is on the development of systematic and automated-oriented techniques for the analysis of permutability in some sequent calculi. A representation of… (More)

- Tatjana Lutovac, James Harland
- J. Log. Comput.
- 2014

- James Harland, Tatjana Lutovac, Michael Winikoff
- Computational Logic
- 2000

A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming languages for intuitionistic logic in the (single-conclusioned) sequent calculus LJ, but has subsequently been adapted to multiple-conclusioned systems such as those for linear logic. Given… (More)

Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. We brieey review the main problems, which are questions that are still elusive in the design of logic programming languages, from a proof-theoretic point of view. Existing strategies which lead… (More)

Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. In this paper we present some initial work on the problem of making systematic the design of logic programming languages. In particular, we identify and discuss several key properties of… (More)