977 search results - page 61 / 196 » Logic programming with infinite sets |
88
Voted
ICANN
2009
Springer
15 years 7 months 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...
110
click to vote
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
LPAR
2005
Springer
15 years 6 months ago
2005
Springer
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
112
Voted
AI
1999
Springer
15 years 5 days ago
1999
Springer
Forthcoming in the Journal of Aritificial Intelligence We introduce mathematical programming and atomic decomposition as the basic modal (T-Box) inference techniques for a large c...
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...