Efficient Model Generation through Compilation

Schütz, Heribert; Geisler, Tim

doi:10.1006/inco.1999.2863

Cited by 4 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RACE eliminates some of this inefficiency by pruning all clauses satchmo clause(true,Head,Index) from the Prolog data base once they have been used. Furthermore, RACE uses a simple, but effective algorithm [16] to select relevant clauses for the (un-) satisfiability check. Other authors have proposed alternative algorithms to identify relevant clauses.…”

Section: Performance Of Racementioning

confidence: 99%

Reasoning in Attempto Controlled English

Fuchs

Schwertel

2003

Principles and Practice of Semantic Web Reasoning

View full text Add to dashboard Cite

Attempto Controlled English (ACE) -a subset of English that can be unambiguously translated into first-order logic -is a knowledge representation language. To support automatic reasoning in ACE we have developed the Attempto Reasoner RACE (Reasoning in ACE). RACE proves that one ACE text is the logical consequence of another one, and gives a justification for the proof in ACE. Variations of the basic proof procedure permit query answering and consistency checking. Reasoning in RACE is supported by auxiliary first-order axioms and by evaluable functions. The current implementation of RACE is based on the model generator Satchmo. Reasoning in Attempto Controlled EnglishNorbert E. Fuchs, Uta Schwertel Institut für Informatik, Universität Zürich {fuchs, uschwert}@ifi.unizh.ch http://www.ifi.unizh.ch/attempto Abstract. Attempto Controlled English (ACE) -a subset of English that can be unambiguously translated into first-order logic -is a knowledge representation language. To support automatic reasoning in ACE we have developed the Attempto Reasoner RACE (Reasoning in ACE). RACE proves that one ACE text is the logical consequence of another one, and gives a justification for the proof in ACE. Variations of the basic proof procedure permit query answering and consistency checking. Reasoning in RACE is supported by auxiliary first-order axioms and by evaluable functions. The current implementation of RACE is based on the model generator Satchmo.

show abstract

Section: Performance Of Racementioning

confidence: 99%