Sciweavers

3773 search results - page 552 / 755
» Logical Reasoning
Sort
View
139
Voted
KR
2004
Springer
15 years 10 months ago
Expressive Power and Succinctness of Propositional Languages for Preference Representation
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
Sylvie Coste-Marquis, Jérôme Lang, Pa...
LPNMR
2004
Springer
15 years 10 months ago
Using Criticalities as a Heuristic for Answer Set Programming
Abstract. Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic program...
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
130
Voted
TPHOL
2003
IEEE
15 years 10 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews
FM
2003
Springer
98views Formal Methods» more  FM 2003»
15 years 10 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
156
Voted
ICLP
2003
Springer
15 years 10 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...