Sciweavers

129 search results - page 19 / 26
» Benchmarking Reasoners for Multi-Ontology Applications
Sort
View
TPHOL
1998
IEEE
13 years 11 months ago
The Village Telephone System: A Case Study in Formal Software Engineering
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...
Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gun...
ICTAI
1997
IEEE
13 years 11 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
AAAI
2010
13 years 9 months ago
Planning in Dynamic Environments: Extending HTNs with Nonlinear Continuous Effects
Planning in dynamic continuous environments requires reasoning about nonlinear continuous effects, which previous Hierarchical Task Network (HTN) planners do not support. In this ...
Matthew Molineaux, Matthew Klenk, David W. Aha
GIS
2004
ACM
14 years 8 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
14 years 4 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu