Results 21 to 30 of about 93,680 (316)
Knowledge Refactoring for Inductive Program Synthesis [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Humans constantly restructure knowledge to use it more efficiently. Our goal is to give a machine learning system similar abilities so that it can learn more efficiently. We introduce the knowledge refactoring problem, where the goal is to restructure a learner's knowledge base to reduce its size and to minimise redundancy in it.
Dumancic, Sebastijan +2 more
openaire +4 more sources
Induction by Coinduction and Control Operators in Call-by-Name [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This paper studies emulation of induction by coinduction in a call-by-name language with control operators. Since it is known that call-by-name programming languages with control operators cannot have general initial algebras, interaction of induction ...
Yoshihiko Kakutani, Daisuke Kimura
doaj +1 more source
Induction Models on \mathbb{N} [PDF]
LPAR-23: 23rd International Conference on Logic for Programming,
Artificial Intelligence and Reasoning, 2020, Vol. 73, Pages 169-190, 2020 Mathematical induction is a fundamental tool in computer science and mathematics. Henkin initiated the study of formalization of mathematical induction restricted to the setting when the base case B is set to singleton set containing 0 and a unary generating function S.
arxiv +1 more source
Inductive Data Types Based on Fibrations Theory in Programming
Journal of Computing and Information Technology, 2016 Traditional methods including algebra and category theory have some deficiencies in analyzing semantics properties and describing inductive rules of inductive data types, we present a method based on Fibrations theory aiming at those questions above.
Decheng Miao +3 more
doaj +1 more source
Initial Algebra Semantics for Cyclic Sharing Tree Structures [PDF]
Logical Methods in Computer Science, 2010 Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural induction and ...
Makoto Hamana
doaj +1 more source
Information, 2022 This paper focuses on the study of automated process discovery using the Inductive visual Miner (IvM) and Directly Follows visual Miner (DFvM) algorithms to produce a valid process model for educational process mining in order to understand and predict ...
Hameed AlQaheri, Mrutyunjaya Panda
doaj +1 more source
A weak HOAS approach to the POPLmark Challenge [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Capitalizing on previous encodings and formal developments about nominal calculi and type systems, we propose a weak Higher-Order Abstract Syntax formalization of the type language of pure System ...
Alberto Ciaffaglione, Ivan Scagnetto
doaj +1 more source
Business Model Transformation of a Service Provider on a Sharing Economy Platform
Journal of Business Models, 2021 The study investigates a business model transformation of a service provider on a sharing economy platform (Airbnb) using a dynamic business model perspective.
Olga Novikova
doaj +1 more source
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
Sequent Calculus and Equational Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We
Nicolas Guenot, Daniel Gustafsson
doaj +1 more source