192
click to vote
SIGIR
2012
ACM
13 years 7 months ago
2012
ACM
The term online reputation addresses trust relationships amongst agents in dynamic open systems. These can appear as ratings, recommendations, referrals and feedback. Several repu...
186
click to vote
JAIR
2012
13 years 7 months ago
2012
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
175
click to vote
JAIR
2012
13 years 7 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
143
click to vote
JAIR
2012
13 years 7 months ago
2012
In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantic...
143
click to vote
CAV
2012
Springer
13 years 7 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
158
click to vote
CAV
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
142
click to vote
CAV
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. We develop compositional analysis algorithms for detecting nontermination in multithreaded programs. Our analysis explores fair and ultimatelyperiodic executions—i.e., ...
150
click to vote
CAV
2012
Springer
13 years 7 months ago
2012
Springer
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
152
click to vote
CAV
2012
Springer
13 years 7 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...