Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A confluent connection calculus

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

This work1is concerned with basic issues of the design of cal­culi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and prove its strong completeness. This enables the design of backtrack-free con­trol regimes. To demonstrate that the underlying fairness condition is reasonably implementable we define an effective search strategy.

Description

Keywords

Citation

Source

Book Title

Entity type

Access Statement

License Rights

Restricted until