Results 31 to 40 of about 72,713 (317)
Few-Shot Induction of Generalized Logical Concepts via Human Guidance
Frontiers in Robotics and AI, 2020 We consider the problem of learning generalized first-order representations of concepts from a small number of examples. We augment an inductive logic programming learner with 2 novel contributions.
Mayukh Das +3 more
doaj +1 more source
Inductive Logic Programming as Abductive Search [PDF]
, 2010 We present a novel approach to non-monotonic ILP and its implementation called TAL (Top-directed Abductive Learning). TAL overcomes some of the completeness problems of ILP systems based on Inverse Entailment and is the first top-down ILP system that ...
Corapi, Domenico +2 more
core +1 more source
Abella: A System for Reasoning about Relational Specifications
Journal of Formalized Reasoning, 2014 The Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive and co-inductive reasoning over relations. Abella supports the λ-tree approach to treating syntax containing binders: it allows simply typed λ-terms to be
David Baelde +6 more
doaj +1 more source
Learning and reasoning with graph data
Frontiers in Artificial Intelligence, 2023 Reasoning about graphs, and learning from graph data is a field of artificial intelligence that has recently received much attention in the machine learning areas of graph representation learning and graph neural networks.
Manfred Jaeger
doaj +1 more source
Answer Set Programming for Regular Inference
Applied Sciences, 2020 We propose an approach to non-deterministic finite automaton (NFA) inductive synthesis that is based on answer set programming (ASP) solvers. To that end, we explain how an NFA and its response to input samples can be encoded as rules in a logic program.
Wojciech Wieczorek +2 more
doaj +1 more source
Productive Corecursion in Logic Programming [PDF]
, 2017 Logic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task.
Komendantskaya, Ekaterina, Li, Yue
core +2 more sources
A Curry-Howard Correspondence for Linear, Reversible Computation [PDF]
Logical Methods in Computer ScienceIn this paper, we present a linear and reversible programming language with inductives types and recursion. The semantics of the languages is based on pattern-matching; we show how ensuring syntactical exhaustivity and non-overlapping of clauses is ...
Kostia Chardonnet +2 more
doaj +1 more source
Logical Rule-Based Knowledge Graph Reasoning: A Comprehensive Survey
Mathematics, 2023 With its powerful expressive capability and intuitive presentation, the knowledge graph has emerged as one of the primary forms of knowledge representation and management.
Zefan Zeng, Qing Cheng, Yuehang Si
doaj +1 more source
Proofs for free - parametricity for dependent types [PDF]
, 2012 Reynolds' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type.
Bernardy, J. P. +2 more
core +2 more sources
Learning Weak Constraints in Answer Set Programming [PDF]
, 2015 This paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP).
Broda, Krysia +2 more
core +2 more sources