Sciweavers

3047 search results - page 252 / 610
» On the Meaning of Logical Completeness
Sort
View
213
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 7 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
202
Voted
ENTCS
2008
96views more  ENTCS 2008»
15 years 7 months ago
Maude as a Platform for Designing and Implementing Deep Inference Systems
Deep inference is a proof theoretical methodology that generalizes the traditional notion of inference in the sequent calculus: in contrast to the sequent calculus, the deductive ...
Ozan Kahramanogullari
193
Voted
IGPL
2006
90views more  IGPL 2006»
15 years 7 months ago
Surviving Abduction
Abduction or retroduction, as introduced by C.S. Peirce in the double sense of searching for explanatory instances and providing an explanation (i.e., involving the procedure of s...
Walter Alexandre Carnielli
211
Voted
AI
2004
Springer
15 years 7 months ago
On the revision of preferences and rational inference processes
Orderings and inference relations can be successfully used to model the behavior of a rational agent. This behavior is indeed represented either by a set of ordered pairs that ref...
Michael Freund
199
Voted
AEI
1999
120views more  AEI 1999»
15 years 7 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy