Sciweavers

4370 search results - page 56 / 874
» Algebra of Logic Programming
Sort
View
119
Voted
ICFP
2010
ACM
15 years 1 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary
95
Voted
IPL
2006
120views more  IPL 2006»
15 years 20 days ago
Propositional dynamic logic of context-free programs and fixpoint logic with chop
This paper compares Propositional Dynamic Logic of Non-Regular Programs and Fixpoint Logic with Chop. It identifies a fragment of the latter which is equiexpressive to the former....
Martin Lange, Rafal Somla
85
Voted
EUSFLAT
2009
126views Fuzzy Logic» more  EUSFLAT 2009»
14 years 10 months ago
Fuzzy Answer Set Programming with Literal Preferences
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, M...
123
Voted
CADE
2004
Springer
16 years 1 months ago
Dr.Doodle: A Diagrammatic Theorem Prover
This paper presents the Dr.Doodle system, an interactive theorem prover that uses diagrammatic representations. The assumption underlying this project is that, for some domains (pr...
Daniel Winterstein, Alan Bundy, Corin A. Gurr
99
Voted
JLP
2006
81views more  JLP 2006»
15 years 19 days ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter