Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

On definite program answers and least He...

Drabent, Włodzimierz...

Free

Share this content

On definite program answers and least Herbrand models by Drabent, Włodzimierz ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	11-03-2015
Summary	A sufficient and necessary condition is given under which least Herbrand models exactly characterize the answers of definite clause programs. To appear in Theory and Practice of Logic Programming (TPLP).
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	https://arxiv.org/abs/1503.03324

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Drabent, Włodzimierz. On definite program answers and least Herbrand models. N.A. March 11, 2015. Accessed October 02, 2025. https://online.provdatabase.com/cite/18425

APA 7th EditionReferences

Drabent, Włodzimierz. (2015). On definite program answers and least Herbrand models. N.A. https://online.provdatabase.com/cite/18425

Chicago 17th EditionReferences

Drabent, Włodzimierz. On definite program answers and least Herbrand models. N.A. 2015. https://online.provdatabase.com/cite/18425

HarvardReferences

Drabent, Włodzimierz. (2015). On definite program answers and least Herbrand models. [Online]. N.A. Available from: https://online.provdatabase.com/cite/18425. (Accessed 02 October 2025).

Harvard AustraliaReferences

Drabent, Włodzimierz, 2015, On definite program answers and least Herbrand models, N.A, viewed 02 October 2025, <https://online.provdatabase.com/cite/18425>

MLA 9th EditionWorks Cited

Drabent, Włodzimierz. On definite program answers and least Herbrand models. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/18425.

Share this eBook