Short note: procedural semantics and negative information of elementary formal system

DOI10.1016/0743-1066(92)90022-UzbMath0768.68089OpenAlexW2064065290MaRDI QIDQ3992228

Akihiro Yamamoto

Publication date: 13 August 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90022-u

zbMATH Keywords

formal languagesclosed world assumptionprocedural semanticsnegation as failureelementary formal systemSLD- resolutionleast Herbrand modelexistence of infinite derivationsinference of negated ground atomslogic programming with associative unification

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (6)

Learning elementary formal systems with queries. ⋮ Advanced elementary formal systems. ⋮ Refutable language learning with a neighbor system. ⋮ Generating languages by a derivation procedure for elementary formal systems ⋮ Analogical logic program synthesis algorithm that can refute inappropriate similarities ⋮ Towards a mathematical theory of machine discovery from facts

This page was built for publication: Short note: procedural semantics and negative information of elementary formal system