Towards an information flow in logic programming
This paper proposes a theoretical foundation of what could be an information flow in logic programming. Several information flow definitions (based on success/failure, substitution answers, bisimulation between goals) are stated and compared. Decision procedures are given for each definition and complexity is studied for specific classes of logic programs.
Keywords: Logic programming, Information flow, Computational complexity
Download Full-Text
ABOUT THE AUTHOR
Antoun Yaacoub
Antoun Yaacoub is currently a Ph.D. student in computer science in Université Paul Sabatier at Toulouse – France. He’s conducting his research at the Institut de recherche informatique de Toulouse (IRIT) – France. His research focuses on defining, identifying and analyzing the flow of information (from a security point of view) in logic programs. He previously worked on various aspects of the French language and focused on the types of links existing between the words.
Antoun Yaacoub
Antoun Yaacoub is currently a Ph.D. student in computer science in Université Paul Sabatier at Toulouse – France. He’s conducting his research at the Institut de recherche informatique de Toulouse (IRIT) – France. His research focuses on defining, identifying and analyzing the flow of information (from a security point of view) in logic programs. He previously worked on various aspects of the French language and focused on the types of links existing between the words.
