Sciweavers

479 search results - page 41 / 96
» A quantified logic of evidence
Sort
View
LOGCOM
2010
124views more  LOGCOM 2010»
15 years 11 days ago
Analytic Methods for the Logic of Proofs
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
Marcelo Finger
ERCIMDL
2007
Springer
110views Education» more  ERCIMDL 2007»
15 years 8 months ago
Annotation-Based Document Retrieval with Probabilistic Logics
Annotations are an important part in today’s digital libraries and Web information systems as an instrument for interactive knowledge creation. Annotation-based document retrieva...
Ingo Frommholz
DS
2001
118views Database» more  DS 2001»
15 years 3 months ago
Constraints as Mobile Specifications in E-Commerce Applications
We show how quantified constraints expressed in a sub-language of first-order logic, againstashareddatamodelthatisfreetoevolve, provideanexcellentwayof transporting domain-specific...
Kit-ying Hui, Peter M. D. Gray, Graham J. L. Kemp,...
APAL
2008
92views more  APAL 2008»
15 years 2 months ago
The complexity of random ordered structures
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
Joel H. Spencer, Katherine St. John
IJAC
2010
231views more  IJAC 2010»
14 years 11 months ago
Descriptive Complexity of Finite Abelian Groups
Title of dissertation: MODEL THEORY AND COMPLEXITY THEORY Walid Gomaa Doctor of Philosophy, 2007 Dissertation directed by: Professor William Gasarch Department of Computer Science...
Walid Gomaa