1999
DOI: 10.1007/3-540-48242-3_4
|View full text |Cite
|
Sign up to set email alerts
|

Evidence Algorithm and Sequent Logical Inference Search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0
3

Year Published

2001
2001
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 2 publications
0
4
0
3
Order By: Relevance
“…As to item (ii), the SAD procedure in the form of special sequential calculus [57] was substantially improved according to the following requirements to deduction in the EA style: preserving the syntactic form of the original problem; goal-oriented inference search; efficient deductive transformations in the signature of the original theory (i.e., preliminary skolemization is not necessary); separation from deductive process of equality handling and/or solution of equations.…”
Section: Evolution Of Studies On the Evidence Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…As to item (ii), the SAD procedure in the form of special sequential calculus [57] was substantially improved according to the following requirements to deduction in the EA style: preserving the syntactic form of the original problem; goal-oriented inference search; efficient deductive transformations in the signature of the original theory (i.e., preliminary skolemization is not necessary); separation from deductive process of equality handling and/or solution of equations.…”
Section: Evolution Of Studies On the Evidence Algorithmmentioning
confidence: 99%
“…Further modifications of the calculus from [57] are proposed in [58], one of them underlied the logic technique of the newly designed English-language SAD (System for Automated Deduction) with ForTheL as a source language.…”
Section: Evolution Of Studies On the Evidence Algorithmmentioning
confidence: 99%
“…У ході виконання ІНТАС-проєкту був розроблений англомовний варіант мови TL, названий ForTheL (Formal Theory Language) [13] і була істотно поліпшена процедура ПВЦ у вигляді секвенційного числення [14], виходячи з вимог до дедукції у стилі АО: синтаксична форма вихідної задачі повинна зберігатися; пошук виводу повинен бути цілеорієнтованим; дедуктивні перетворення повинні ефективно проводитися в сигнатурі вихідної теорії (тобто сколемізація не повинна бути обов'язковою); обробка рівностей/рішення рівнянь повинні бути відокремлені від дедуктивного процесу.…”
Section: український період (1998теперішній час)unclassified
“…This project gave an impulse for modifying the calculus from [19] in several directions, one of which concerns classical logic (see, e.g., [20]) and the others concern non-classical ones. As a result, new research efforts have been carried out to obtain a wide spectrum of results on efficient inference search in classical and intuitionistic logics as well as in their modal extensions.…”
Section: )mentioning
confidence: 99%