The Common Sense Application Model of Architecture (CSAMOA) was created to organize applications, libraries, and corpora of common sense reasoning with a concise taxonomy and guidelines that encurage sustainable code. In this paper, I discuss the motivations for selecting ConceptNet for reimplementation, compromises made in the enforcement of the architecture, observations on the effectiveness ...

For a machine to act with common sense, it is not enough that information about commonsense things be written down in a formal language. What actual knowledge—i.e. conclusions available for informing actions—a formalization is meant to provide cannot be determined without some specification of what sort of reasoning is expected. The traditional view in epistemic logic says that agents see all l...

In this paper we present a novel explanation of the source of indefinite information in common sense reasoning: Indefinite information arises from reports about the world expressed in terms of concepts that have been defined using only definite rules. Adopting this point of view, we show that first-order logic is insufficiently expressive to handle important examples of common sense reasoning. ...

We study a syntax for specifying quantitative assertions —functions mapping program states to numbers—for probabilistic verification. prove that our is expressive in the following sense: Given any C , if function f expressible syntax, then each initial state σ expected value of evaluated final reached after termination on (also called weakest preexpectation wp[ ]( )) also syntax. As consequence...

Most logic-based AI research works at a meta-theoretical level, producing new logics and studying their properties. Little effort is made to show how these logics can be used to formalise object-level theories of common sense. In the spirit of Pat Hayes’s Naive Physics Manifesto, the present paper supplies a formalisation of a non-trivial benchmark problem in common sense physical reasoning, na...

The logics of formal inconsistency (LFIs) are logics that allow to explicitly formalize the concepts of consistency and inconsistency by means of formulas of their language. Contradictoriness, on the other hand, can always be expressed in any logic, provided its la nguage includes a symbol for negation. Besides being able to represent the distinction between contradiction and inconsistency, LFI...

In this tutorial paper we show how to construct a step-indexed logical relation for a call-by-name programming language with recursive types and show that it is complete with respect to contextual equivalence. We then show how the same constructions can be used to define a step-indexed model, in the standard categorical sense, of the language. We hope that this will make step-indexed techniques...

The problem of replicating the flexibility of human common-sense reasoning has captured the imagination of computer scientists since the early days of Alan Turing’s foundational work on computation and the philosophy of artificial intelligence. In the intervening years, the idea of cognition as computation has emerged as a fundamental tenet of Artificial Intelligence (AI) and cognitive science....

for playing basketball, or to make more abstract comparisons, like deciding whether the purple ball or yellow ball is heavier to solve the puzzle above. With good reasoning skills, you can learn new things more easily, both at school and in your favorite hobbies. These skills help you to: (1) make sense of new information by linking it to other things that you already know, (2) understand the p...

This is an account of the semantics of a family of logics whose paradigm member is the relevant logic R of Anderson and Belnap. The formal semantic theory is well worn, having been discussed in the literature of such logics for over a quarter of a century. What is new here is the explication of that formal machinery in a way intended to make sense of it for those who have claimed it to be esote...