382 search results - page 35 / 77 » Complexity and Expressive Power of Logic Programming |
PNPM
1989
13 years 11 months ago
1989
We present SPNP, a powerful GSPN package developed at Duke University. SPNP allows the modeling of complex system behaviors. Advanced constructs are available, such as markingdepe...
AAAI
2010
13 years 9 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
NJC
2000
13 years 7 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
AAAI
1992
13 years 9 months ago
1992
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
ICFP
2000
ACM
14 years 2 days ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...