Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11889/2102
DC FieldValueLanguage
dc.contributor.authorYahya, Adnan-
dc.contributor.authorBruggemann, Thomasen_US
dc.contributor.authorEisinger , Norberten_US
dc.contributor.authorPanne, Svenen_US
dc.contributor.authorTorge, Sunnaen_US
dc.contributor.authorBry, Francoisen_US
dc.contributor.authorGeisler, Timen_US
dc.contributor.authorSchutz, Heriberten_US
dc.date.accessioned2016-10-08T06:45:13Z-
dc.date.available2016-10-08T06:45:13Z-
dc.date.issued1998-6-
dc.identifier.urihttp://hdl.handle.net/20.500.11889/2102-
dc.description.abstractSatchmo is an automated theorem prover for rst-order predicate logic implemented in Prolog. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. It enabled the development of a novel and e cient technique to compute minimal Herbrand models, which prevents the generation of non-minimal models that would later have to be ltered out in a post-processing step. It also encouraged the development of several advanced e ciency enhancing techniques that result in a highly competitive performance on standard benchmark problems-
dc.language.isoenen_US
dc.publisherResearchGateen_US
dc.subject.lcshElectronic data processing-
dc.subject.lcshMinimal model generation-
dc.subject.lcshIncrementality-
dc.subject.lcshCompilation-
dc.subject.lcshMinimal model generation and compilation-
dc.titleSatchmo: minimal model generation and compilation (system description)en_US
dc.typeArticleen_US
newfileds.departmentEngineering and Technologyen_US
newfileds.item-access-typeopen_accessen_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
item.languageiso639-1other-
Appears in Collections:Fulltext Publications
Files in This Item:
File Description SizeFormat
satchmo.pdf224.32 kBAdobe PDFView/Open
Show simple item record

Page view(s)

50
Last Week
0
Last month
3
checked on May 11, 2022

Download(s)

11
checked on May 11, 2022

Google ScholarTM

Check


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