304 search results - page 7 / 61 » Analysis of the paraconsistency in some logics |
ASP
2003
Springer
14 years 21 days ago
2003
Springer
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. This is not quite so. This paper shows an...
SAS
2001
Springer
13 years 12 months ago
2001
Springer
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
ASM
2010
ASM
14 years 17 days ago
2010
ASM
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
FMOODS
2007
13 years 9 months ago
2007
Rewriting logic provides a powerful, flexible mechanism for language definition and analysis. This flexibility in design can lead to problems during analysis, as different desi...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...