Results 11 to 20 of about 839,866 (101)
Discussion on Redundant Processing Algorithm of Association Rules Based on Hypergraph in Data Mining
With the rapid advancement of big data, it is becoming a great problem for people to find objective information in the database. The relevance data processing rule for digging the information can be the way. Relevance data processing rule for digging the
Jintan Zhu
doaj +1 more source
Learning Probabilities: Towards a Logic of Statistical Learning [PDF]
We propose a new model for forming beliefs and learning about unknown probabilities (such as the probability of picking a red marble from a bag with an unknown distribution of coloured marbles).
Alexandru Baltag +2 more
doaj +1 more source
Translating dependent type theory into higher order logic [PDF]
This paper describes a translation of the complex calculus of dependent type theory into the relatively simpler higher order logic originally introduced by Church. In particular, it shows how type dependency as found in Martin-Lof's Intuitionistic Type Theory can be simulated in the formulation of higher order logic mechanized by the HOL theoremproving
Jacobs, B, Melham, T
openaire +2 more sources
Henkin semantics for reasoning with natural language
The frequency of intensional and non-first-order definable operators in natural languages constitutes a challenge for automated reasoning with the kind of logical translations that are deemed adequate by formal semanticists.
Michael Hahn, Frank Richter
doaj +1 more source
Classical Higher-Order Processes [PDF]
Classical Processes (CP) is a calculus where the proof theory of classical linear logic types communicating processes with mobile channels, a la pi-calculus.
Montesi, Fabrizio
core +5 more sources
Harnessing Higher-Order (Meta-)Logic to Represent and Reason with Complex Ethical Theories [PDF]
The computer-mechanization of an ambitious explicit ethical theory, Gewirth's Principle of Generic Consistency, is used to showcase an approach for representing and reasoning with ethical theories exhibiting complex logical features like alethic and ...
A Gewirth +16 more
core +2 more sources
A Two-Level Logic Approach to Reasoning about Typed Specification Languages [PDF]
International audienceThe two-level logic approach (2LL) to reasoning about computational specifications, as implemented by the Abella theorem prover, represents derivations of a specification language as an inductive definition in a reasoning logic ...
Chaudhuri, Kaustuv, Southern, Mary
core +5 more sources
Essential Incompleteness of Arithmetic Verified by Coq [PDF]
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized.
J. Despeyroux +5 more
core +2 more sources
Automated theorem proving for dependent typed theories via a translation to higher-order logic
Higher-order logic (HOL) offers a simple syntax and semantics for representing and reasoning about typed mathematical concepts. There are many state-of-the-art automated theorem provers for HOL. But the type system of HOL lacks advanced features where types may depend on terms. This is useful as many mathematical notions are inherently dependent typed.
openaire +1 more source
Revised and reprinted; originally in Dov Gabbay & Franz Guenthner (eds.), Handbook of Philosophical Logic, Volume IV. Kluwer 133-251. -- Two sorts of property theory are distinguished, those dealing with intensional contexts property abstracts ...
Bealer, George, Monnich, Uwe
core +1 more source

