Sciweavers

605 search results - page 65 / 121
» Dealing with logical omniscience
Sort
View
AAAI
1990
13 years 9 months ago
The Complexity of Closed World Reasoning and Circumscription
Closed world reasoning is a common nonmonotonic technique that allows for dealing with negative information in knowledge and data bases. We present a detailed analysis of the comp...
Marco Cadoli, Maurizio Lenzerini
DEBU
2008
156views more  DEBU 2008»
13 years 7 months ago
Towards Automatic Test Database Generation
Testing is one of the most expensive and time consuming activities in the software development cycle. In order to reduce the cost and the time to market, many approaches to automa...
Carsten Binnig, Donald Kossmann, Eric Lo
CORR
2006
Springer
123views Education» more  CORR 2006»
13 years 7 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
ICAIL
2003
ACM
14 years 1 months ago
Specifying and Reasoning with Institutional Agents
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
Filipe Santos, Olga Pacheco
POPL
2006
ACM
14 years 8 months ago
Frame rules from answer types for code pointers
We define a type system, which may also be considered as a simple Hoare logic, for a fragment of an assembly language that deals with code pointers and jumps. The typing is aimed ...
Hayo Thielecke