Sciweavers

499 search results - page 9 / 100
» Logic Programming in a Fragment of Intuitionistic Linear Log...
Sort
View
PLPV
2009
ACM
15 years 6 months ago
Embedding a logical theory of constructions in Agda
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
Ana Bove, Peter Dybjer, Andrés Sicard-Ram&i...
APLAS
2010
ACM
14 years 9 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller
APAL
2005
135views more  APAL 2005»
14 years 9 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
FOSSACS
2004
Springer
15 years 2 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
83
Voted
JAPLL
2006
112views more  JAPLL 2006»
14 years 9 months ago
Intuitionistic hybrid logic
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...
Torben Braüner, Valeria de Paiva