Sciweavers

4266 search results - page 370 / 854
» A Framework for Defining Logics
Sort
View
CADE
2008
Springer
16 years 8 months ago
Combining Theorem Proving with Natural Language Processing
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
Björn Pelzer, Ingo Glöckner
LICS
2008
IEEE
16 years 2 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
EPIA
2007
Springer
16 years 1 months ago
Two Puzzles Concerning Measures of Uncertainty and the Positive Boolean Connectives
Abstract. The two puzzles are the Lottery Paradox and the Amalgamation Paradox, which both point out difficulties for aggregating uncertain information. A generalization of the lot...
Gregory R. Wheeler
DATE
2006
IEEE
133views Hardware» more  DATE 2006»
16 years 1 months ago
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Quantum information processing technology is in its pioneering stage and no proficient method for synthesizing quantum circuits has been introduced so far. This paper introduces a...
Afshin Abdollahi, Massoud Pedram
226
Voted
ASP
2005
Springer
16 years 1 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre