#### 152 Citations

The Completeness of Propositional Resolution: A Simple and Constructive Proof

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2006

This note gives a simple and constructive proof of the completeness of propositional resolution which consists of an algorithm together with a proof of its correctness. Expand

An investigation of hybrid systems for reasoning in noisy domains

- Computer Science
- 1995

This thesis discusses aspects of design, implementation and theory of expert systems, which have been constructed in a novel way using techniques derived from several existing areas of Arti cial Intelligence research, with others taken from connectionist approaches into one homogenous architecture. Expand

Transformation Rules for GHC Programs

- Computer Science
- FGCS
- 1988

The presentation of the transformation rules for (Flat) GHC programs suggests that idempotent substitutions with preferred directions of bindings are an appropriate tool for modeling information in (concurrent) logic programming. Expand

Basic Features and Development of the Critical-Pair/Completion Procedure

- Mathematics, Computer Science
- RTA
- 1985

The Analytic Truth and Falsity of Disjunctions

- Computer Science, Mathematics
- Cogn. Sci.
- 2019

Three experiments corroborated further predictions of the mental model theory and tended to infer 'mirror-image' evaluations that yield the same possibilities for false disjunction as those for true disjunctions. Expand

Why Machines Don’t (yet) Reason Like People

- Computer Science
- KI - Künstliche Intelligenz
- 2019

This paper traces their limitations back to two historical developments in AI: the motivation to establish automated theorem-provers for systems of mathematical logic, and the formulation of nonmonotonic systems of reasoning. Expand

Mechatronics Engineering Methodology of systemic codification of logical formal reasoning, in solving applied problems.

- Computer Science
- 2017

This paper reports an investigation to demonstrate the existence of any relationship between the intervention activities problem solving and structuring the creative logical thinking, presenting a methodological, didactic, playful, creative and cutting-edge procedure, called "logical process". Expand

Modèles probabilistes formels pour problèmes cognitifs usuels

- Art
- 2016

Comment un modele incomplet et incertain de l'environnement peut-il etre utilise pour decider, agir, apprendre, raisonner et percevoir efficacement ? Voici le defi central que les systemes cognitifs… Expand

Monads for the formalization of a pattern matching procedure

- Mathematics, Computer Science
- Programming and Computer Software
- 2014

A mathematical language is presented that is based on the concepts of category theory and allows one to formally describe various types of pattern matching from a unified point of view. Expand

Bayesian Programming

- Computer Science
- 2013

Emphasizing probability as an alternative to Boolean logic, Bayesian Programming covers new methods to build probabilistic programs for real-world applications and encourages readers to explore emerging areas, such as bio-inspired computing, and develop new programming languages and hardware architectures. Expand