The foundation of logic programming is set in the general framework proposed by defining the basic concepts such as Horn clause, query and solution, and proving fundamental results such as the existence of init
In this paper, we provide a theoretical foundation for declarative testing in arbitrary first order logic programming using recursion theories. In particular, we present a theoretical analysis of three kinds of declarative testing method: I/O testing, I/Y testing, and X/Y testing for logic ...
Manna 和 Waldinger 称之为“计算机科学的微积分”,而 Halpern 的论文 On the Unusual Effectiveness of Logic in Computer Science 中则收录了大量逻辑学为计算机科学提供的洞察力和至关重要的工具。的确,他们发现:“实际上,逻辑学对计算机科学来说远比在数学中更加有效。这相当引人注目,特别是过去一百年来,逻辑学...
Foundations of Computing(共28册),这套丛书还有 《Realistic Compiler Generation》《The Stable Marriage Problem》《Algebraic Theory of Processes》《Dynamic Logic》《Algebraic Semantics of Imperative Programs》等。 喜欢读"Foundations for Programming Languages"的人也喜欢 ··· Types and Programming Languag...
Declarative testing is very important in logic program developments, as without testing no one can guarantee that every program is definitely correct, no matter how elegant and high-level the programming languages used. Unfortunately, the activity of declarative testing for logic programs (or even the...
of data structures. Finally, you’ll learn how to prove things, such as proving that a possible algorithm will, in principle, actually work. When you’re finished with this course, you’ll have the skills and knowledge of mathematics and logic needed to understand the mathematical basis of ...
Read the latest articles of Electronic Notes in Theoretical Computer Science at ScienceDirect.com, Elsevier’s leading platform of peer-reviewed scholarly literature
computational applications of logic, combinatorics, computational complexity, communication complexity, circuit complexity, combinatorial optimization, computational game theory, computational geometry, computational learning theory, continuous optimization, cryptography, foundations of machine learning, online algorithms...
and these are all unrelated to each other. So, if you did your proof of some data structure in one logic, you wouldn’t know that it carried over to reasoning about data structures in another logic, or that you could compose these things. Also, it’s just ridiculously complicated. Okay...
a Schmüdgen-like Positivstellensatz yields a converging hierarchy of lower bounds for polynomial optimization problems with compact constraint set; see [22, Theorem 4.8] and Theorem2.6. These bounds can be computed via a convex optimization program calledrelative entropy programming (REP)[22, Theore...