tlooto
Sign up
Computer Science

Automated Reasoning

T. Jebelean, B. Buchberger, Temur Kutsia, Nikolaj Popov, W. Schreiner, W. Windsteiger

2004.11.1Intelligenza Artificiale

DOI: 10.1007/b98691

tlooto Summary

The Bernays-Schoenfinkel clause fragment over linear arithmetic: BS(LRA) is considered in detail and a constrained closure is denoted as Λ ∥ C · σ where σ is grounding for Λ and C and a constrained closure Λ ∥ C · σ denotes the ground constrained clause Λσ ∥ Cσ.

Abstract

Abstract is not available.

Citation format

JEBELEAN, T., et al. Automated reasoning. Intelligenza Artificiale, 2004, 7: 63–101.