Editing
Logic Programs with Monotone Cardinality Atoms
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: Logic Programs with Monotone Cardinality Atoms Abstract: This research investigates logic programs, or mca-programs, that use monotone cardinality atoms (mc-atoms). These atoms represent constraints on the lower bounds of cardinalities of sets. The study develops a theory for mca-programs and demonstrates that the one-step provability operator generalizes to these programs, but with nondeterminism. The main results show that mca-programs generalize normal logic programming, logic programming with cardinality atoms, and disjunctive logic programming. The research also presents a natural representation of normal logic programs as mca-programs, preserving all semantics. Research Question: How can monotone cardinality atoms be used to extend existing logic programming formalisms? Methodology: The study develops a theory for mca-programs by closely following the development of normal logic programming and lifting its major concepts, techniques, and results to the setting of mca-programs. It introduces models, supported models, and stable models for mca-programs, using a nondeterministic one-step provability operator. The research also presents a way to generalize the Gelfond-Lifschitz reduct to mca-programs. Results: The research shows that mca-programs generalize normal logic programming, logic programming with cardinality atoms, and disjunctive logic programming. It also demonstrates that the one-step provability operator generalizes to mca-programs, but with nondeterminism. Implications: The use of monotone cardinality atoms in logic programming allows for the representation of cardinality constraints, which can be useful in various applications. The research also provides a unified framework for understanding and comparing different logic programming formalisms. Link to Article: https://arxiv.org/abs/0310063v1 Authors: arXiv ID: 0310063v1 [[Category:Computer Science]] [[Category:Programs]] [[Category:Logic]] [[Category:Mca]] [[Category:Programming]] [[Category:Atoms]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information