Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: equational theories

Sortuj według:

Ogranicz wyniki do:

A hybrid method for finite model search in equational

Benhamou B., Henocque L.

Fundamenta Informaticae

1999

Vol. 39, Nr 1,2

21-38

Finite model and counter model generation is a potential alternative in automated theorem proving. In this paper, we introduce a system called FMSET which generates finite structures representing models of equational theories. FMSET performs a satisfiability test over a set of special first order clauses called ß clauses". The algorithm's originality stems from the combination of a standard enumeration technique and the use of first order resolution. Our objective is to obtain more propagations and still achieve good space and time complexity. Several experiments over a variety of problems have been pursued. FMSET uses symmetry to prune from the search tree unwanted isomorphic branches

Automated deduction techniques for studying Rough Algebras

Vigneron L.

Fundamenta Informaticae

1998

Vol. 33, nr 1

85-103

We present a non-exhaustive state of the art. In the domain of deduction in first-order logic with equality, describing different strategies introduced over the years: strategies for selecting deduction steps, for eliminating redundant information, for delaying the resolution of unsolved or too difficult problems, for applying deductions with built-in-properties. We also present the system dalac that implements our deduction techniques modulo associative-commutative properties. Finally we detail an application of those techniques to the study of non-classical logics, work realised in collaboration with Prof. Wasilewska (Stony Brook University, New York).