The following pages link to Christoph Benzmüller (Q287280):
Displaying 50 items.
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- (Q523300) (redirect page) (← links)
- Computer-assisted analysis of the Anderson-Hájek ontological controversy (Q523303) (← links)
- Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
- Organization, transformation, and propagation of mathematical knowledge in \(\Omega \)mega (Q841687) (← links)
- Towards computer aided mathematics (Q865628) (← links)
- Computer supported mathematics with \(\Omega\)MEGA (Q865650) (← links)
- Combined reasoning by automated cooperation (Q946572) (← links)
- A deontic logic reasoning infrastructure (Q1670720) (← links)
- The higher-order prover Leo-III (Q1799072) (← links)
- Comparing approaches to resolution based higher-order theorem proving (Q1868166) (← links)
- Embedding and automating conditional logics in classical higher-order logic (Q1935597) (← links)
- Quantified multimodal logics in simple type theory (Q1945702) (← links)
- Public announcement logic in HOL (Q2055768) (← links)
- Mechanised assessment of complex natural-language arguments using expressive logic combinations (Q2180221) (← links)
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support (Q2211865) (← links)
- Automating free logic in HOL, with an experimental application in category theory (Q2303232) (← links)
- Cut-elimination for quantified conditional logic (Q2363418) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- \(\Omega\)-ANTS -- An open approach at combining interactive and automated theorem proving (Q2751539) (← links)
- Towards learning new methods in proof planning (Q2751546) (← links)
- Distributed assertion retrieval (Q2767923) (← links)
- On Logic Embeddings and Gödel’s God (Q2787333) (← links)
- Effective Normalization Techniques for HOL (Q2817937) (← links)
- Automating Free Logic in Isabelle/HOL (Q2819197) (← links)
- Agent-Based HOL Reasoning (Q2819202) (← links)
- Assertion-level proof representation with under-specification (Q2847390) (← links)
- \textsc{Plat}{\(\Omega\)}: a mediator between text-editors and proof assistance systems (Q2867939) (← links)
- HOL Based First-Order Modal Logic Provers (Q2870120) (← links)
- Proofs and Reconstructions (Q2964467) (← links)
- Higher-Order Modal Logics: Automation and Applications (Q2970308) (← links)
- Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) (Q3058454) (← links)
- Multimodal and intuitionistic logics in simple type theory (Q3061280) (← links)
- (Q3075241) (← links)
- (Q3086775) (← links)
- (Q3086787) (← links)
- Interacting with Modal Logics in the Coq Proof Assistant (Q3194730) (← links)
- Computational Hermeneutics: An Integrated Approach for the Logical Analysis of Natural-Language Arguments (Q3305694) (← links)
- LeoPARD — A Generic Platform for the Implementation of Higher-Order Reasoners (Q3453128) (← links)
- Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics (Q3455772) (← links)
- (Q3457212) (← links)
- There Is No Best $$\beta $$ -Normalization Strategy for Higher-Order Reasoners (Q3460064) (← links)
- LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (Q3541699) (← links)
- THF0 – The Core of the TPTP Language for Higher-Order Logic (Q3541725) (← links)
- Combining Logics in Simple Type Theory (Q3582734) (← links)
- Cut-Simulation in Impredicative Logics (Q3613411) (← links)
- Cut-Simulation and Impredicativity (Q3623018) (← links)
- (Q4249891) (← links)
- (Q4263170) (← links)
- (Q4428312) (← links)
