Sciweavers

4266 search results - page 213 / 854
» A Framework for Defining Logics
Sort
View
CSL
2007
Springer
15 years 10 months ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding
CADE
2010
Springer
15 years 7 months ago
Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion
In order to support the verification of programs, verification tools such as ACL2 or Isabelle try to extract suitable induction axioms from the definitions of terminating, recursiv...
Markus Aderhold
FSKD
2008
Springer
113views Fuzzy Logic» more  FSKD 2008»
15 years 7 months ago
Incremental Knowledge Base for Uncertain Reasoning
Evidence theory has been widely applied to uncertain reasoning. However, the evidence space and hypothesis space are each defined as a fixed set. If the theory is applied to solve...
Qingxiang Wu, Xi Huang, David A. Bell, Guilin Qi, ...
ENTCS
2006
153views more  ENTCS 2006»
15 years 6 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
ACL
2007
15 years 8 months ago
A Linguistic Service Ontology for Language Infrastructures
This paper introduces conceptual framework of an ontology for describing linguistic services on network-based language infrastructures. The ontology defines a taxonomy of processi...
Yoshihiko Hayashi