Sciweavers

1950 search results - page 153 / 390
» Lambda-Free Logical Frameworks
Sort
View
KI
1995
Springer
15 years 10 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher
EUSFLAT
2001
15 years 8 months ago
Similarity-based unification: a multi-adjoint approach
The aim of this paper is to build a formal model for similarity-based fuzzy unification in multi-adjoint logic programs. Specifically, a general framework of logic programming whi...
Jesús Medina, Manuel Ojeda-Aciego, Peter Vo...
LANMR
2004
15 years 8 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad
ENTCS
2007
113views more  ENTCS 2007»
15 years 6 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
GC
2004
Springer
15 years 10 months ago
The SOCS Computational Logic Approach to the Specification and Verification of Agent Societies
This article summarises part of the work done during the first two years of the SOCS project, with respect to the task of modelling interaction amongst CL-based agents. It describe...
Marco Alberti, Federico Chesani, Marco Gavanelli, ...