Sciweavers

3693 search results - page 203 / 739
» Splitting a Logic Program
Sort
View
DALT
2008
Springer
15 years 8 months ago
Inductive Negotiation in Answer Set Programming
This paper provides a logical framework of negotiating agents who have capabilities of evaluating and building proposals. Given a proposal, an agent decides whether it is acceptabl...
Chiaki Sakama
FORTE
2010
15 years 7 months ago
Heap-Dependent Expressions in Separation Logic
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
Jan Smans, Bart Jacobs, Frank Piessens
IUI
1999
ACM
15 years 10 months ago
Programming by Demonstration: An Inductive Learning Formulation
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
Tessa A. Lau, Daniel S. Weld
LOPSTR
1999
Springer
15 years 10 months ago
Roles of Program Extension
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
Ralf Lämmel, Günter Riedewald, Wolfgang ...
DEXAW
2003
IEEE
113views Database» more  DEXAW 2003»
15 years 11 months ago
Integrating Ontology Languages and Answer Set Programming
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
Stijn Heymans, Dirk Vermeir