Sciweavers

226 search results - page 27 / 46
» BDDs and Automated Deduction
Sort
View
CSL
2010
Springer
13 years 8 months ago
A Sequent Calculus with Implicit Term Representation
We investigate a modification of the sequent calculus which s a first-order proof into its abstract deductive structure and a unifier which renders this structure a valid proof. We...
Stefan Hetzl
CORR
2002
Springer
114views Education» more  CORR 2002»
13 years 7 months ago
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalu...
Michael Leuschel, Jesper Jørgensen, Wim Van...
ILP
2003
Springer
14 years 22 days ago
ILP for Mathematical Discovery
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
Simon Colton, Stephen Muggleton
DAC
2005
ACM
14 years 8 months ago
Towards scalable flow and context sensitive pointer analysis
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
Jianwen Zhu
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift