Completeness Result of SLDNF-resolution for a relevant Class of Logic Programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg ; 1997-04
- Klassifikation
-
Informatik
- Schlagwort
-
Beweistheorie
logische Programmierung
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2006
- Urheber
-
Ntienjem, Ebénézer
- URN
-
urn:nbn:de:bvb:384-opus4-2232
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Ntienjem, Ebénézer
- Universität Augsburg
Entstanden
- 2006
Ähnliche Objekte (12)
On weak completeness of intuitionistic predicate logic
On weak completeness of intuitionistic predicative logic
A Note on Expressive Completeness of Modal Logic
Termporal logic of programs
Internal definability and completeness in modal logic
The completeness theorem for adapted probability logic
Induction of Linear Temporal Logic Programs
On elementary loops of logic programs
Induction of linear temporal logic programs
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
Stationary generated models of generalized logic programs
Completeness of Information Sources
On weak completeness of intuitionistic predicate logic
On weak completeness of intuitionistic predicative logic
A Note on Expressive Completeness of Modal Logic
Termporal logic of programs
Internal definability and completeness in modal logic
The completeness theorem for adapted probability logic
Induction of Linear Temporal Logic Programs
On elementary loops of logic programs
Induction of linear temporal logic programs
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
Stationary generated models of generalized logic programs
Completeness of Information Sources
On weak completeness of intuitionistic predicate logic
On weak completeness of intuitionistic predicative logic
A Note on Expressive Completeness of Modal Logic
Termporal logic of programs
Internal definability and completeness in modal logic
The completeness theorem for adapted probability logic
Induction of Linear Temporal Logic Programs
On elementary loops of logic programs
Induction of linear temporal logic programs
Elementary completeness properties of intuitionistic logic with a note on negations of prenex formulae
Stationary generated models of generalized logic programs