2002•Unpublished venueRequires access

-Ants { An open approach at combining Interactive and Automated Theorem Proving

Christoph Benzm, Volker Sorge

Open publisher page 40 citations

Abstract

We present the -Ants theorem prover that is built on top of an agent-based command suggestion mechanism. The theorem prover inherits bene cial properties from the underlying suggestion mechanism such as run-time extendibility and resource adaptability. Moreover, it supports the distributed integration of external reasoning systems. We also discuss how the implementation and modeling of a calculus in our agent-based approach can be investigated wrt. the inheritance of properties such as completeness and soundness.

About this research paper

What this paper is about

We present the -Ants theorem prover that is built on top of an agent-based command suggestion mechanism. The theorem prover inherits bene cial properties from the underlying suggestion mechanism such as run-time extendibility and resource adaptability. Moreover, it supports the distributed integration of external reasoning systems. We also discuss how the implementation and modeling of a calculus in our agent-based approach can be investigated wrt. the inheritance of properties such as completeness and soundness.

Why it matters

OpenAlex reports 40 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We present the -Ants theorem prover that is built on top of an agent-based command suggestion mechanism. The theorem prover inherits bene cial properties from the underlying suggestion mechanism such as run-time extendibility and resource adaptability. Moreover, it supports the distributed integration of external reasoning systems. We also discuss how the implementation and modeling of a calculus in our agent-based approach can be investigated wrt. the inheritance of properties such as completeness and soundness.

Key concepts: Soundness, Automated theorem proving, Gas meter prover, Completeness (order theory), Computer science, Theoretical computer science, Pi calculus, Automated reasoning

Related papers

Back to paper searchBrowse research topicsOriginal source
-Ants { An open approach at combining Interactive and Automated Theorem Proving — Research Paper | ScholarLens