Affiliation:
1. Computer Science Department, Stony Brook University, Stony Brook, NY 11794, U.S.A
Abstract
Abstract
Programming with logic for sophisticated applications must deal with recursion and negation, which together have created significant challenges in logic, leading to many different, conflicting semantics of rules. This paper describes a unified language, DA logic, for design and analysis logic, based on the unifying founded semantics and constraint semantics, that supports the power and ease of programming with different intended semantics. The key idea is to provide meta-constraints, support the use of uncertain information in the form of either undefined values or possible combinations of values and promote the use of knowledge units that can be instantiated by any new predicates, including predicates with additional arguments.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Incremental Computation: What Is the Essence? (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11
2. Integrating Logic Rules with Everything Else, Seamlessly;Theory and Practice of Logic Programming;2023-07
3. Recursive rules with aggregation: a simple unified semantics;Journal of Logic and Computation;2022-11-14
4. Recursive Rules with Aggregation: A Simple Unified Semantics;Logical Foundations of Computer Science;2021-12-16