From first-order logic to automated word generation for Lyee

Author： Amon B.   Ekenberg L.   Johannesson P.   Munguanaze M.   Njabili U.   Manka Tesha R.  

Publisher： Elsevier

ISSN： 0950-7051

Source： Knowledge-Based Systems, Vol.16, Iss.7, 2003-11, pp. : 413-429

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Design of abstract domains using first-order logic

By Marchiori E.  

Theoretical Computer Science, Vol. 222, Iss. 1, 1999-07 ,pp. : 153-179

Elsevier

Access to resources Recommend Favorite

The power of the ''always'' operator in first-order temporal logic

By Kaminski M.   Chung K.W.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 271-281

Elsevier

Access to resources Recommend Favorite

Completeness of a first-order temporal logic with time-gaps

By Baaz M.   Leitsch A.   Zach R.  

Theoretical Computer Science, Vol. 160, Iss. 1, 1996-06 ,pp. : 241-270

Elsevier

Access to resources Recommend Favorite

Automated Refinement of First-Order Horn-Clause Domain Theories

By Richards B.L.  

Machine Learning, Vol. 19, Iss. 2, 1995-05 ,pp. : 95-131

Springer Publishing Company

Access to resources Recommend Favorite

A semantic proof of strong cut-admissibility for first-order Gdel logic

By Lahav Ori   Avron Arnon  

Journal of Logic and Computation, Vol. 23, Iss. 1, 2013-02 ,pp. : 59-86

Oxford University Press

Access to resources Recommend Favorite