Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/510
DC FieldValueLanguage
dc.contributor.authorJaničić, Predragen_US
dc.contributor.authorNarboux, Julienen_US
dc.contributor.authorQuaresma, Pedroen_US
dc.date.accessioned2022-08-13T10:14:42Z-
dc.date.available2022-08-13T10:14:42Z-
dc.date.issued2012-01-01-
dc.identifier.issn01687433en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/510-
dc.description.abstractThe area method for Euclidean constructive geometry was proposed by Chou, Gao and Zhang in the early 1990's. The method can efficiently prove many non-trivial geometry theorems and is one of the most interesting and most successful methods for automated theorem proving in geometry. The method produces proofs that are often very concise and human-readable. In this paper, we provide a first complete presentation of the method. We provide both algorithmic and implementation details that were omitted in the original presentations. We also give a variant of Chou, Gao and Zhang's axiom system. Based on this axiom system, we proved formally all the lemmas needed by the method and its soundness using the Coq proof assistant. To our knowledge, apart from the original implementation by the authors who first proposed the method, there are only three implementations more. Although the basic idea of the method is simple, implementing it is a very challenging task because of a number of details that has to be dealt with. With the description of the method given in this paper, implementing the method should be still complex, but a straightforward task. In the paper we describe all these implementations and also some of their applications. © Springer Science+Business Media B.V. 2010.en_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.ispartofJournal of Automated Reasoningen_US
dc.subjectArea methoden_US
dc.subjectAutomated theorem provingen_US
dc.subjectFormalisationen_US
dc.subjectGeometryen_US
dc.titleThe area method: A recapitulationen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s10817-010-9209-7-
dc.identifier.scopus2-s2.0-84864955220-
dc.identifier.isi000301980200003-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/84864955220-
dc.contributor.affiliationInformatics and Computer Scienceen_US
dc.relation.issn0168-7433en_US
dc.description.rankM21en_US
dc.relation.firstpage489en_US
dc.relation.lastpage532en_US
dc.relation.volume48en_US
dc.relation.issue4en_US
item.openairetypeArticle-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.deptInformatics and Computer Science-
crisitem.author.orcid0000-0001-8922-4948-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

47
checked on Jan 10, 2026

Page view(s)

16
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.