Sciweavers

899 search results - page 77 / 180
» A CTL-Based Logic for Program Abstractions
Sort
View
98
Voted
CORR
2004
Springer
151views Education» more  CORR 2004»
15 years 13 days 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...
106
Voted
ECAI
1992
Springer
15 years 4 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
99
Voted
AMAST
1998
Springer
15 years 4 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
114
Voted
LPNMR
2005
Springer
15 years 6 months ago
Data Integration and Answer Set Programming
Abstract. The rapid expansion of the Internet and World Wide Web led to growing interest in data and information integration, which should be capable to deal with inconsistent and ...
Thomas Eiter
111
Voted
RULEML
2005
Springer
15 years 6 months ago
Merging and Aligning Ontologies in dl-Programs
Abstract. The language of dl-programs is a latest effort in developing an expressive representation for Web-based ontologies. It allows to build answer set programming (ASP) on top...
Kewen Wang, Grigoris Antoniou, Rodney W. Topor, Ab...