Sciweavers

1941 search results - page 173 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
LPNMR
2007
Springer
15 years 9 months ago
Using Answer Sets to Solve Belief Change Problems
We describe BE, an implemented system for solving belief change problems in the presence of actions. We illustrate how we can use BE to compute the result of belief progression, be...
Aaron Hunter, James P. Delgrande, Joel Faber
133
Voted
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 8 months ago
Generating Counterexamples for Multi-valued Model-Checking
Counterexamples explain why a desired temporal logic property fails to hold, and as such are considered to be the most useful form of output from model-checkers. Multi-valued model...
Arie Gurfinkel, Marsha Chechik
144
Voted
ACSC
2002
IEEE
15 years 8 months ago
Intelligent Agents for Automated One-to-Many e-Commerce Negotiation
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
Iyad Rahwan, Ryszard Kowalczyk, H. H. Pham
CCS
2005
ACM
15 years 9 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
AAAI
1997
15 years 5 months ago
Representing Sequences in Description Logics
This paper describes an approach for representing and manipulating sequences in description logics (DLs). The key idea is to represent sequences using sux trees, then represent t...
Haym Hirsh, Daniel Kudenko