Sciweavers

571 search results - page 83 / 115
» Domain Theory in Logical Form
Sort
View
JAR
2006
94views more  JAR 2006»
14 years 11 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
PLDI
2009
ACM
15 years 6 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
ICFP
2006
ACM
15 years 11 months ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
15 years 5 months ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
CIA
2006
Springer
15 years 3 months ago
Market-Inspired Approach to Collaborative Learning
The paper describes a decentralized peer-to-peer multi-agent learning method based on inductive logic programming and knowledge trading. The method uses first-order logic for model...
Jan Tozicka, Michal Jakob, Michal Pechoucek