Sciweavers

2062 search results - page 226 / 413
» Derivatives of Logical Formulas
Sort
View
LFCS
2007
Springer
16 years 22 days ago
The Intensional Lambda Calculus
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
Sergei N. Artëmov, Eduardo Bonelli
KR
2004
Springer
15 years 12 months ago
Ontological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity
Although sorts and unary predicates are semantically identical in order-sorted logic, they are classified as different kinds of properties in formal ontology (e.g. sortal and non...
Ken Kaneiwa, Riichiro Mizoguchi
IPPS
1999
IEEE
15 years 11 months ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
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 ...
JNCA
2007
143views more  JNCA 2007»
15 years 6 months ago
Detecting feature interactions in CPL
An approach for detecting feature interactions in IETF’s Call Processing Language (CPL) scripts is presented. The approach is logic based in the sense that it uses a logic repre...
Yiqun Xu, Luigi Logrippo, Jacques Sincennes