Sciweavers

149 search results - page 27 / 30
» Argumentation Semantics for Defeasible Logics
Sort
View
PPDP
2007
Springer
14 years 3 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
BSL
2006
114views more  BSL 2006»
13 years 9 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
VL
1993
IEEE
159views Visual Languages» more  VL 1993»
14 years 1 months ago
A Visual Logic Programming Language Based on Sets and Partitioning Constraints
This paper presents a new programming language named SPARCL that has four major elements: it is a visual language, it is a logic programming language, it relies on sets to organiz...
Lindsey L. Spratt, Allen L. Ambler
HASKELL
2006
ACM
14 years 3 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
ICFP
2007
ACM
14 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson