4257 search results - page 151 / 852 » The Logical Modularity of Programs |
220
click to vote
KR
2010
Springer
15 years 8 months ago
2010
Springer
Existing action calculi provide rich, declarative formalisms for reasoning about actions. BDI-based programming languages like AgentSpeak, on the other hand, are procedural and ge...
151
Voted
ML
2006
ACM
15 years 6 months ago
2006
ACM
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
167
click to vote
SLP
1994
15 years 7 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
196
click to vote
AIIA
1995
Springer
15 years 9 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
162
click to vote
ICANN
2009
Springer
16 years 25 days ago
2009
Springer
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...