Results 21 to 30 of about 6,681,112 (349)
Learning efficient logic programs
Machine-mediated learning, 2015 When machine learning programs from data, we ideally want to learn efficient rather than inefficient programs. However, existing inductive logic programming (ILP) techniques cannot distinguish between the efficiencies of programs, such as permutation ...
Andrew Cropper
semanticscholar +1 more source
The Journal of Logic Programming, 1994 AbstractThis paper presents an overview and a survey of logic program synthesis. Logic program synthesis is interpreted here in a broad way; it is concerned with the following question: given a specification, how do we get a logic program satisfying the specification?
Deville, Yves, Lau, KK.
openaire +3 more sources
Complexities of Logic Programs with Convex Aggregates [PDF]
Jisuanji kexueASP is a paradigm for descriptive problem solving and is widely used in fields such as planning,diagnosis,scheduling and bioinformatics.To enhance the expressive power of ASP,it has introduced aggregate functions from database systems and proposed ...
WANG Xianglong, WANG Yisong, XIE Zhongtao
doaj +1 more source
Verification of Imperative Programs by Constraint Logic Program Transformation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of constraint logic programs (CLP).
Emanuele De Angelis +3 more
doaj +1 more source
Expectation maximization over binary decision diagrams for probabilistic logic programs
Intelligent Data Analysis, 2013 Recently much work in Machine Learning has concentrated on using expressive representation languages that combine aspects of logic and probability. A whole field has emerged, called Statistical Relational Learning, rich of successful applications in a ...
Elena Bellodi, Fabrizio Riguzzi
semanticscholar +1 more source
Nominal logic programming [PDF]
ACM Transactions on Programming Languages and Systems, 2008 Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, α-equivalence). This article investigates logic programming based on nominal logic. We describe some typical nominal logic programs, and develop the model-theoretic,
Cheney, James, Urban, Christian
openaire +4 more sources
Contribution of Warsaw Logicians to Computational Logic
Axioms, 2016 The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa.
Damian Niwiński
doaj +1 more source
The Journal of Logic Programming, 1993 Summary: We present a model for distributed logic programming based on AND- parallelism and on explicit message-passing primitives. The communication mechanism is inspired by \textit{R. Milner}'s CCS [Lect. Notes Comput. Sci. 92 (1980; Zbl 0452.68027)].
BROGI, ANTONIO, R. Gorrieri
openaire +3 more sources
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling [PDF]
Journal of Artificial Intelligence Research, 2001 We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. definite clause programs containing probabilistic facts with a parameterized distribution.
Taisuke Sato, Yoshitaka Kameya
semanticscholar +1 more source