Results 41 to 50 of about 16,576 (234)

Prolog and expert systems [PDF]

, 1987
The first part of the thesis provides an introduction to the logic programming language Prolog and some areas of current research. The use of compilation to make Prolog faster and more efficient is studied and a modified representation for complex ...
Davies, Peter Leslie
core  

A Practical Type Analysis for Verification of Modular Prolog Programs [PDF]

, 2008
Regular types are a powerful tool for computing very precise descriptive types for logic programs. However, in the context of real life, modular Prolog programs, the accurate results obtained by regular types often come at the price of efficiency.
Pietrzak, Pawel, Puebla, German, Hermenegildo, Manuel, Pawel S. Pietrzak, Jesús Correas Fernández, Manuel V. Hermenegildo, Hermenegildo, Manuel V., Correas Fernandez, Jesús, Correas, Jesus, Germán Puebla, Puebla Sánchez, Alvaro Germán   +10 more
core   +1 more source

Henrik Wergelands «Den første Gang» som prolog og talehandling

Edda, 2018
Sammendrag «Den første Gang» hører til blant Wergelands mest kjente dikt, men er hittil ikke blitt gjort til gjenstand for en helhetlig tolkning. Denne artikkelen setter seg fore å bøte på denne mangelen i Wergelandsforskningen.
Frode Helmich Pedersen
doaj   +1 more source

Spider vs. Prolog

Proceedings of the International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing, 2009
Control Network Programming is a programming paradigm that integrates ideas from imperative programming, declarative programming, rule-based systems, nondeterministic programming and graphical programming. Its computation rule is based on an extended specific version of backtracking.
Golemanov, T., Kratchanov, K., Golemanova, E.   +2 more
openaire   +2 more sources

Representation sharing for Prolog [PDF]

Theory and Practice of Logic Programming, 2011
AbstractRepresentation sharing can reduce the memory footprint of a program by sharing one representation between duplicate terms. The most common implementation of representation sharing in functional programming systems is known as hash-consing. In the context of Prolog, representation sharing has been given little attention.
Nguyen, Phuong-Lan, Demoen, Bart
openaire   +4 more sources

Data privacy model using blockchain reinforcement federated learning approach for scalable internet of medical things

CAAI Transactions on Intelligence Technology, EarlyView.
Abstract Internet of Medical Things (IoMT) has typical advancements in the healthcare sector with rapid potential proof for decentralised communication systems that have been applied for collecting and monitoring COVID‐19 patient data. Machine Learning algorithms typically use the risk score of each patient based on risk factors, which could help ...
Chandramohan Dhasaratha, Mohammad Kamrul Hasan, Shayla Islam, Shailesh Khapre, Salwani Abdullah, Taher M. Ghazal, Ahmed Ibrahim Alzahrani, Nasser Alalwan, Nguyen Vo, Md Akhtaruzzaman   +9 more
wiley   +1 more source

Experimenting with independent and-parallel prolog using standard prolog [PDF]

, 1991
This paper presents an approximation to the study of parallel systems using sequential tools. The Independent And-parallelism in Prolog is an example of parallel processing paradigm in the framework of logic programming, and implementations like
Hermenegildo, Manuel V., Carro Liñares, Manuel   +1 more
core   +1 more source

A Framework for Safe and Efficient Fishbone Layouts in Warehouse Operations [PDF]

Journal of South Asian Logistics and Transport
The adoption of Industry 4.0 technologies has transformed warehouse management, enhancing its efficiency, accuracy, and profitability. However, optimising warehouse layouts, particularly fishbone designs, remains complex and often relies on intricate ...
S. Nimishan, K. Theekshani
doaj   +1 more source

OR-parallel PROLOG in flat concurrent PROLOG

The Journal of Logic Programming, 1989
AbstractWe describe a simple or-parallel execution algorithm for PROLOG that naturally collects all solutions to a goal. For a large class of programs the algorithm has O(log n) overhead and exhibits O(n/(log n)2) parallel speedup over the standard sequential algorithm.
openaire   +2 more sources

UZMAN VERİ-TABANI SİSTEMLERİ VE ÖNERİLER

Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, 2003
Bu çalışmada uzman sistemler, ilişkisel veri­tabanı sistemleri ve nesneye -dayalı veri-tabanı sistemleri çalışıldı. Dinamik tip, Ad-hoc sorguları ve bildirimselJik , nesneye-dayalı sistemlerde ve uzma n sistemJerde tartışıldı.
TALAT FIRLAR
doaj   +1 more source