Find link

language:

Find link is a tool written by Edward Betts.

searching for Higher-order logic 33 found (113 total)

First-order (398 words) [view diff] exact match in snippet view article find links to article

uses, where it is contrasted with "allowing some self-reference" (higher-order logic) In detail, it may refer to: First-order approximation First-order

Interactive Theorem Proving (conference) (186 words) [view diff] exact match in snippet view article

ITP brings together the communities using many systems based on higher-order logic such as ACL2, Coq, Mizar, HOL, Isabelle, Lean, NuPRL, PVS, and Twelf

Prototype Verification System (200 words) [view diff] exact match in snippet view article find links to article

types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced

Thousands of Problems for Theorem Provers (208 words) [view diff] exact match in snippet view article find links to article

expressed in a simple text-based format for first order logic or higher-order logic. TPTP is used as the source of some problems in CASC. "The TPTP Problem

HiLog (601 words) [view diff] exact match in snippet view article find links to article

Michael; Warren, David S. (February 1993). "HiLog: A foundation for higher-order logic programming". Journal of Logic Programming. 15 (3): 187–230. doi:10

Higher-order programming (284 words) [view diff] exact match in snippet view article find links to article

Smalltalk, Scala, ML, and Erlang. Prolog#Higher-order programming Higher-order logic programming Reynolds, John C. (1972). "Definitional Interpreters for

Marieke Huisman (470 words) [view diff] no match in snippet view article find links to article

2001; her dissertation, entitled Reasoning about Java programs in higher order logic using PVS and Isabelle, was supervised by Henk Barendregt. From 2001

Stewart Shapiro (326 words) [view diff] case mismatch in snippet view article find links to article

Scedrov, V. Lifschitz, R. Flagg, R. Smullyan. The Limits of Logic: Higher-Order Logic and the Löwenheim-Skolem Theorem, Routledge, 1996. Special issue of

Unification (computer science) (7,377 words) [view diff] exact match in snippet view article

up to beta-reduction. This version is used in proof assistants and higher-order logic programming, for example Isabelle, Twelf, and lambdaProlog. Finally

Dale Miller (academic) (1,356 words) [view diff] case mismatch in snippet view article

formalized meta-theory. He has co-authored the book Programming with Higher-order Logic. Miller is a Fellow of the Association for Computing Machinery (ACM)

Tobias Nipkow (527 words) [view diff] case mismatch in snippet view article find links to article

Paulson L. and Wenzel M. (2002). Isabelle/HOL — A Proof Assistant for Higher-Order Logic. Springer. Gerwin Klein & Tobias Nipkow (2006). "A Machine-Checked

XSB (432 words) [view diff] exact match in snippet view article find links to article

tabled resolution and supports the HiLog language (permitting limited higher-order logic programming). Tabling enables XSB to implement the well-founded semantics

Peter B. Andrews (344 words) [view diff] exact match in snippet view article find links to article

Inc., Orlando, FL. Andrews, Peter B. (1989). "On connections and higher-order logic". J. Automat. Reason. 5, no. 3, 257–291. Andrews, Peter B.; Bishop

E (theorem prover) (937 words) [view diff] case mismatch in snippet view article

(2008). "LEO-II – A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description)". Automated Reasoning (PDF). Lecture Notes in

Logic translation (7,317 words) [view diff] no match in snippet view article find links to article

Logic translation is the process of representing a text in the formal language of a logical system. If the original text is formulated in ordinary language

David Bostock (philosopher) (527 words) [view diff] case mismatch in snippet view article

Aristotle's Ethics (New York, Oxford University Press, 2000) On Motivating Higher-Order Logic, in Studies in the Philosophy of Logic and Knowledge (ed. Baldwin

Michael Kohlhase (643 words) [view diff] case mismatch in snippet view article find links to article

Fields Mathematics, Computer Science Thesis A Mechanization of Sorted Higher-Order Logic Based on the Resolution Principle (1994) Doctoral advisor Jörg Siekmann

Automated reasoning (1,398 words) [view diff] no match in snippet view article find links to article

implementation. It is essentially another proof assistant for classical higher order logic. Coq Developed in France, Coq is another automated proof assistant

Inductive programming (2,546 words) [view diff] case mismatch in snippet view article find links to article

(2001). "Knowledge Representation, Computation, and Learning in Higher-order Logic" (PDF). {{cite journal}}: Cite journal requires |journal= (help) Lloyd

Probabilistic logic (2,003 words) [view diff] exact match in snippet view article find links to article

universally quantified hypotheses. The theory has also been extended to higher-order logic. Both solutions are purely theoretical but have spawned practical

Associative array (2,802 words) [view diff] no match in snippet view article find links to article

Collins, Graham; Syme, Donald (1995). "A theory of finite maps". Higher Order Logic Theorem Proving and Its Applications. Lecture Notes in Computer Science

E. W. Beth Dissertation Prize (136 words) [view diff] no match in snippet view article find links to article

λ-Calculus Università di Bologna 2022 Alexander Bentkamp Superposition for Higher Order Logic Vrije Universiteit Amsterdam 2021 Ilaria Canavotto Where Responsibility

Higher-order abstract syntax (1,074 words) [view diff] exact match in snippet view article find links to article

programming language which directly supported λ-bindings in syntax was the higher-order logic programming language λProlog. The paper that introduced the term HOAS

Flora-2 (786 words) [view diff] case mismatch in snippet view article find links to article

W. Chen, M. Kifer and D.S. Warren (1993), HiLog: A Foundation for Higher-Order Logic Programming. Journal of Logic Programming, 1993. A.J. Bonner and M

Kurt Gödel (5,814 words) [view diff] exact match in snippet view article find links to article

end of the talk, mentioned that this result does not generalise to higher-order logic, thus hinting at his incompleteness theorems. Gödel published his

Rulelog (889 words) [view diff] case mismatch in snippet view article find links to article

Language Grosof B.N. (2013) Rapid Text-Based Authoring of Defeasible Higher-Order Logic Formulas, via Textual Logic and Rulelog. In: Morgenstern L., Stefaneas

Addition (10,120 words) [view diff] no match in snippet view article find links to article

Schubert, E. Thomas, Phillip J. Windley, and James Alves-Foss. "Higher Order Logic Theorem Proving and Its Applications: Proceedings of the 8th International

Semantics of Business Vocabulary and Business Rules (2,611 words) [view diff] no match in snippet view article find links to article

SBVR are typed first order predicate logic with equality, restricted higher order logic (Henkin semantics), restricted deontic and alethic modal logic, set

Brigitte Pientka (249 words) [view diff] case mismatch in snippet view article find links to article

science. She completed her Ph.D. in 2003, with the dissertation Tabled Higher-Order Logic Programming supervised by Frank Pfenning. She joined McGill University

Heyting algebra (6,294 words) [view diff] exact match in snippet view article find links to article

algebra; it is the Heyting algebra of truth values of the intuitionistic higher-order logic induced by the topos. More generally, the set of subobjects of any

Parity of zero (7,501 words) [view diff] case mismatch in snippet view article find links to article

Lawrence C.; Wenzel, Markus (2002), Isabelle/Hol: A Proof Assistant for Higher-Order Logic, Springer, ISBN 978-3-540-43376-7 Nuerk, Hans-Christoph; Iversen,

Constraint logic programming (6,028 words) [view diff] case mismatch in snippet view article find links to article

programming." AAAI/IAAI. 1999. Michaylov, Spiro, and Frank Pfenning. "Higher-Order Logic Programming as Constraint Logic Programming." PPCP. Vol. 93. 1993

Glossary of artificial intelligence (29,481 words) [view diff] exact match in snippet view article find links to article

sense, propositional logic is the foundation of first-order logic and higher-order logic. proximal policy optimization (PPO) A reinforcement learning algorithm