Sciweavers

1331 search results - page 145 / 267
» Description logic reasoning using the PTTP approach
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
15 years 11 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CADE
2004
Springer
15 years 12 months ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
ICLP
2009
Springer
16 years 7 months ago
Answer Set Programming with Constraints Using Lazy Grounding
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
Agostino Dovier, Alessandro Dal Palù, Enric...
CADE
2011
Springer
14 years 6 months ago
Exploiting Symmetry in SMT Problems
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
David Déharbe, Pascal Fontaine, Stephan Mer...
HICSS
2003
IEEE
112views Biometrics» more  HICSS 2003»
15 years 11 months ago
Creating a Scenariologic - Design and Application of a Repeatable Methodology
Context scenarios are widely used for assessing the robustness of strategies and policies in both the private and the public sector. Royal Dutch Shell, for instance, has become re...
Bert Enserink