Search Results for author:
Found 6 papers, 3 papers with code
Sensala: a Dynamic Semantics System for Natural Language Processing
Here we describe Sensala , an open source framework for the semantic interpretation of natural language that provides the logical meaning of a given text.
Proceedings of the Fifth Workshop on Proof eXchange for Theorem Proving
The PxTP workshop series brings together researchers working on various aspects of communication, integration, and cooperation between reasoning systems and formalisms, with a special focus on proofs.
Scavenger 0.1: A Theorem Prover Based on Conflict Resolution
This paper introduces Scavenger, the first theorem prover for pure first-order logic without equality based on the new conflict resolution calculus.
An Expressive Probabilistic Temporal Logic
This paper argues that a combined treatment of probabilities, time and actions is essential for an appropriate logical account of the notion of probability; and, based on this intuition, describes an expressive probabilistic temporal logic for reasoning about actions with uncertain outcomes.
Conflict Resolution: a First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning
This paper defines the (first-order) conflict resolution calculus: an extension of the resolution calculus inspired by techniques used in modern SAT-solvers.
Logic in Computer Science F.4.1; I.2.3
Formalization, Mechanization and Automation of Gödel's Proof of God's Existence
Automatic verification of the consistency of the axioms and definitions with Nitpick.
