Sciweavers

850 search results - page 114 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
IJCAI
1993
15 years 7 months ago
Nonmonotonic Model Inference-A Formalization of Student Modeling
A student model description language and its synthesis method are presented. The language called SMDL is based on a logic programming language taking 4 truth values such as true, ...
Mitsuru Ikeda, Yasuyuki Kono, Riichiro Mizoguchi
PPDP
2009
Springer
16 years 6 days ago
Model-checking higher-order functions
We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can ea...
Naoki Kobayashi
CORR
2000
Springer
144views Education» more  CORR 2000»
15 years 5 months ago
Sequence-Based Abstract Interpretation of Prolog
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
PEPM
2011
ACM
14 years 8 months ago
Calculating tree navigation with symmetric relational zipper
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
Yuta Ikeda, Susumu Nishimura
TPHOL
1999
IEEE
15 years 10 months ago
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
Mark Aagaard, Robert B. Jones, Carl-Johan H. Seger