725 search results - page 31 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
119
click to vote
ESOP
2009
Springer
15 years 6 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
106
click to vote
CSL
1995
Springer
15 years 6 months ago
1995
Springer
In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an ...
WWW
2008
ACM
16 years 3 months ago
2008
ACM
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
117
Voted
AAAI
2008
15 years 4 months ago
2008
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
115
Voted
FUIN
2007
15 years 2 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...