Sciweavers

1063 search results - page 5 / 213
» Order and Negation as Failure
Sort
View
CL
2000
Springer
13 years 11 months ago
Proving Failure in Functional Logic Programs
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
Francisco Javier López-Fraguas, Jaime S&aac...
ECP
1997
Springer
130views Robotics» more  ECP 1997»
13 years 11 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
FSTTCS
2006
Springer
13 years 11 months ago
The Meaning of Ordered SOS
Structured Operational Semantics (SOS) is a popular method for defining semantics by means of deduction rules. An important feature of deduction rules, or simply SOS rules, are neg...
Mohammad Reza Mousavi, Iain C. C. Phillips, Michel...
SIGIR
2008
ACM
13 years 7 months ago
Intuition-supporting visualization of user's performance based on explicit negative higher-order relevance
Modeling the beyond-topical aspects of relevance are currently gaining popularity in IR evaluation. For example, the discounted cumulated gain (DCG) measure implicitly models some...
Heikki Keskustalo, Kalervo Järvelin, Ari Pirk...
ESSOS
2009
Springer
14 years 2 months ago
Toward Non-security Failures as a Predictor of Security Faults and Failures
In the search for metrics that can predict the presence of vulnerabilities early in the software life cycle, there may be some benefit to choosing metrics from the non-security rea...
Michael Gegick, Pete Rotella, Laurie Williams