2020
DOI: 10.1007/978-3-030-46714-2_11
|View full text |Cite
|
Sign up to set email alerts
|

Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 41 publications
0
14
0
Order By: Relevance
“…Unfortunately, in current practice such schema specifications and documentations for digital editions are only rarely made easily accessible. 16 The suggested way to associate a TEI/XML document instance with a schema by the xml-model processing instruction [14,Sect. v.7.2] seems not used at all.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Unfortunately, in current practice such schema specifications and documentations for digital editions are only rarely made easily accessible. 16 The suggested way to associate a TEI/XML document instance with a schema by the xml-model processing instruction [14,Sect. v.7.2] seems not used at all.…”
Section: Discussionmentioning
confidence: 99%
“…KBSET is free software. It depends only on a T E X distribution (it has been tested with TeX Live) and on SWI-Prolog, both of which are also free software, 16 Actually, the authors were (in November 2019) not able to find any correspondence edition where a formal specification of the used customized schema is referenced from the TEI/XML documents or specified on the Web site. Informal edition guidelines can be found, for example, on the Web sites of Alfred-Escher Briefedition, Briefe und Texte aus dem intellektuellen Berlin um 1800 and hallerNet.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…As embedded reasoners we used the first-order theorem provers Prover9 [20] and CMProver [9,29], the first-order model generator Mace4 [20], and an implementation [29,30] of the DLS algorithm [10] for second-order quantifier elimination, which is based on Ackermann's Lemma [1]. Reasoner outputs computed during processing of the PIE document are presented with the introductory phrases This formula is valid:, This formula is not valid: and Result of elimination:.…”
Section: Preliminariesmentioning
confidence: 99%
“…The expectation is that further, previously unnoticed or obscured aspects and details of the proof become apparent. The used framework, PIE ("Proving, Interpolating, Eliminating") [29,30] embeds automated reasoners, in particular for first-order theorem proving and second-order quantifier elimination, in a system for defining formula macros and rendering L A T E X-formatted presentations of formula macro definitions and reasoner outputs. In fact, the present paper is the generated output of such a PIE document.…”
Section: Introductionmentioning
confidence: 99%