5198 search results - page 718 / 1040 » A Logic of Agent Programs |
145
click to vote
ENTCS
2007
15 years 6 months ago
2007
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
176
Voted
LOGCOM
1998
15 years 6 months ago
1998
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
171
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
137
click to vote
AAAI
1994
15 years 8 months ago
1994
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the...
195
click to vote
DIS
1999
Springer
15 years 11 months ago
1999
Springer
After two decades of research on automated discovery, many principles are shaping up as a foundation of discovery science. In this paper we view discovery science as automation of ...