Sciweavers

59 search results - page 7 / 12
» Lifting abstract interpreters to quantified logical domains
Sort
View
ICLP
2001
Springer
13 years 11 months ago
Higher-Precision Groundness Analysis
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
Michael Codish, Samir Genaim, Harald Sønder...
CORR
2004
Springer
151views Education» more  CORR 2004»
13 years 7 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete Unabridged Version
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 safe omission of the occ...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
CLEF
2005
Springer
14 years 27 days ago
A Logic Programming Based Approach to QA@CLEF05 Track
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
Paulo Quaresma, Irene Pimenta Rodrigues
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ATAL
2009
Springer
14 years 1 months ago
Abstraction in model checking multi-agent systems
ion in model checking multi-agent systems Mika Cohen Department of Computing Imperial College London London, UK Mads Dam Access Linnaeus Center Royal Institute of Technology Stockh...
Mika Cohen, Mads Dam, Alessio Lomuscio, Francesco ...