Sciweavers

746 search results - page 111 / 150
» Connectionist Propositional Logic
Sort
View
AAAI
1990
14 years 11 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
DEXA
2010
Springer
157views Database» more  DEXA 2010»
14 years 10 months ago
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
Khalil Ben Mohamed, Michel Leclère, Marie-L...
SYNTHESE
2008
85views more  SYNTHESE 2008»
14 years 10 months ago
Objective Bayesianism with predicate languages
Objective Bayesian probability is often defined over rather simple domains, e.g., finite event spaces or propositional languages. This paper investigates the extension of objectiv...
Jon Williamson
AROBOTS
1998
113views more  AROBOTS 1998»
14 years 9 months ago
Grounding Mundane Inference in Perception
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
Ian Horswill
CORR
2011
Springer
170views Education» more  CORR 2011»
14 years 1 months ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano