Sciweavers

3228 search results - page 190 / 646
» Computationally Sound Proofs
Sort
View
JAR
2008
77views more  JAR 2008»
15 years 6 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
INFFUS
2006
104views more  INFFUS 2006»
15 years 6 months ago
Reasoning with multiple-source information in a possibilistic logic framework
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
Salem Benferhat, Claudio Sossai
JFP
2006
88views more  JFP 2006»
15 years 6 months ago
Type-based confinement
Confinement properties impose a structure on object graphs which can be used to enforce encapsulation properties. From a practical point of view, encapsulation is essential for bu...
Tian Zhao, Jens Palsberg, Jan Vitek
JOLLI
2006
76views more  JOLLI 2006»
15 years 6 months ago
A Modal Interpretation of the Logic of Interrogation
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
Rani Nelken, Chung-chieh Shan
FUIN
2007
90views more  FUIN 2007»
15 years 6 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier