Results 11 to 20 of about 11,317 (263)
Induction: A Logical Analysis [PDF]
AbstractThe aim of this contribution is to provide a rather general answer to Hume’s problem. To this end, induction is treated within a straightforward formal paradigm, i.e., several connected levels of abstraction. Within this setting, many concrete models are discussed.
openaire +2 more sources
Classical logic with Mendler induction [PDF]
AbstractWe investigate (co-) induction in classical logic under the propositions-as-types paradigm, considering propositional, second-order and (co-) inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-) iterator and show that it is strongly normalizing. We prove this using a reducibility argument.
Devesas Campos, Marco, Fiore, Marcelo
openaire +2 more sources
PURE INDUCTIVE LOGIC WITH FUNCTIONS [PDF]
AbstractWe consider the version of Pure Inductive Logic which obtains for the language with equality and a single unary function symbol giving a complete characterization of the probability functions on this language which satisfy Constant Exchangeability.
Elizabeth Howarth, Jeffrey B. Paris
openaire +1 more source
Logika Induktif dan Deduktif Dalam Tradisi Pemikiran USUL AL-FIQH
Logic occupies a central position in the tradition of usul al-fiqh thought. Besides referring to the verbal revelation, the formulation of the rules of usul al-fiqh is also based on formal logic so that it cannot be easily cracked all ...
A. Yasid A. Yasid
doaj +1 more source
Probabilistic inductive constraint logic [PDF]
AbstractProbabilistic logical models deal effectively with uncertain relations and entities typical of many real world domains. In the field of probabilistic logic programming usually the aim is to learn these kinds of models to predict specific atoms or predicates of the domain, called target atoms/predicates. However, it might also be useful to learn
Fabrizio Riguzzi +4 more
openaire +3 more sources
A History of Probabilistic Inductive Logic Programming
The field of Probabilistic Logic Programming (PLP) has seen significant advances in the last 20 years, with many proposals for languages that combine probability with logic programming.
Fabrizio eRiguzzi +2 more
doaj +1 more source
Maximum Entropy Applied to Inductive Logic and Reasoning
This editorial explains the scope of the special issue and provides a thematic introduction to the contributed papers.
Jürgen Landes, Jon Williamson
doaj +1 more source
(Co)inductive Proof Systems for Compositional Proofs in Reachability Logic [PDF]
Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and inherit the ...
Vlad Rusu, David Nowak
doaj +1 more source
Extending Coinductive Logic Programming with Co-Facts [PDF]
We introduce a generalized logic programming paradigm where programs, consisting of facts and rules with the usual syntax, can be enriched by co-facts, which syntactically resemble facts but have a special meaning.
Davide Ancona +2 more
doaj +1 more source

