In this paper we propose a new generic scheme CFLP(D ), intended as a logical and semantic framework for lazy Constraint Functional Logic Programming over a parametrically given co...
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...