Sciweavers

4257 search results - page 38 / 852
» The Logical Modularity of Programs
Sort
View
PPCP
1993
14 years 1 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
ICECCS
2002
IEEE
84views Hardware» more  ICECCS 2002»
14 years 2 months ago
An Empirical Comparison of Modularity of Procedural and Object-oriented Software
A commonly held belief is that applications written ina object-oriented languages are more modular than those written in procedural languages. This paper presents results from an ...
Lisa K. Ferrett, Jeff Offutt
AAAI
2006
13 years 10 months ago
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning
Several forms of reasoning in AI
Georg Gottlob, Reinhard Pichler, Fang Wei
VRST
1999
ACM
14 years 1 months ago
Visualising logic programs in virtual worlds
Logic Programming as well as Virtual Reality applications have achieved a lot in the last few years. In this paper we present an architecture, a methodology and two simple example...
Themis Panayiotopoulos, Spyros Vosinakis, Sophia K...
TPHOL
2007
IEEE
14 years 3 months ago
Using XCAP to Certify Realistic Systems Code: Machine Context Management
Formal, modular, and mechanized verification of realistic systems code is desirable but challenging. Verification of machine context management (a basis of multi-tasking) is one ...
Zhaozhong Ni, Dachuan Yu, Zhong Shao