# Towards a Decidable LogicWeb via Length-Bounded Derivations

## TL;DR

This paper introduces a length-bounded inference approach to LogicWeb, making it decidable and more manageable by limiting proof steps, and proposes a new module language for structuring logic programs and queries.

## Contribution

It presents a novel length-bounded inference method for LogicWeb and a new module language for better program and query organization.

## Key findings

- Length-bounded inference makes LogicWeb decidable.
- The approach improves tractability of intractable queries.
- A new module language enhances program structuring.

## Abstract

LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form $prov(P,G,n)$ which is a success if a query $G$ can be proved from the web page $P$ within $n$ proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we propose a novel module language for logic programming as a device for structuring programs and queries.