Sciweavers

746 search results - page 134 / 150
» Connectionist Propositional Logic
Sort
View
ESOP
2001
Springer
15 years 2 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
COSIT
1999
Springer
189views GIS» more  COSIT 1999»
15 years 2 months ago
A Formal Model of the Process of Wayfinding in Built Environments
Previous recent research on human wayfinding has focused primarily on mental representations rather than processes of wayfinding. This paper presents a formal model of some aspect...
Martin Raubal, Michael F. Worboys
RIDE
1999
IEEE
15 years 2 months ago
Specification of Cooperative Constraints in Virtual Enterprise Workflow
Workflow systems are an emerging technology which have become increasingly important in the drive for business to provide better services and increase productivity. Intuitively, w...
Anne H. H. Ngu
KR
2000
Springer
15 years 1 months ago
Reduction rules and universal variables for first order tableaux and DPLL
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
Fabio Massacci
AAAI
2004
14 years 11 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea