One way to solve the knowledge acquisition bottleneck is to have ways to translate natural language sentences and discourses to a formal knowledge representation language, especia...
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...
Abstract. Can theorem proving in mathematical logic be addressed by classical mathematical techniques like the calculus of variations? The answer is surprisingly in the affirmative...
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...