Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Sequential composition of propositional logic programs
by
Antić, Christian
in
Algebra
/ Artificial Intelligence
/ Complex Systems
/ Composition
/ Computer Science
/ Decomposition
/ Logic programming
/ Logic programs
/ Mathematics
/ Semantics
/ Syntax
2024
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Sequential composition of propositional logic programs
by
Antić, Christian
in
Algebra
/ Artificial Intelligence
/ Complex Systems
/ Composition
/ Computer Science
/ Decomposition
/ Logic programming
/ Logic programs
/ Mathematics
/ Semantics
/ Syntax
2024
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Sequential composition of propositional logic programs
2024
Request Book From Autostore
and Choose the Collection Method
Overview
This paper introduces and studies the sequential composition and decomposition of propositional logic programs. We show that acyclic programs can be decomposed into single-rule programs and provide a general decomposition result for arbitrary programs. We show that the immediate consequence operator of a program can be represented via composition which allows us to compute its least model without any explicit reference to operators. This bridges the conceptual gap between the syntax and semantics of a propositional logic program in a mathematically satisfactory way.
Publisher
Springer International Publishing,Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.