Sciweavers

117 search results - page 4 / 24
» A Dynamic Approach to Characterizing Termination of General ...
Sort
View
LPNMR
2004
Springer
13 years 11 months ago
Semantics for Dynamic Logic Programming: A Principle-Based Approach
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. The availability of different semantics naturally raises the que...
José Júlio Alferes, Federico Banti, ...
ICLP
2009
Springer
14 years 6 months ago
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...
Miroslaw Truszczynski
SAS
2004
Springer
123views Formal Methods» more  SAS 2004»
13 years 11 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
ICSE
1997
IEEE-ACM
13 years 10 months ago
Characterizing and Modeling the Cost of Rework in a Library of Reusable Software Components
1 In this paper we characterize and model the cost of rework in a Component Factory (CF) organization. A CF is responsible for developing and packaging reusable software components...
Victor R. Basili, Steven E. Condon, Khaled El Emam...
KI
2009
Springer
13 years 10 months ago
Beyond Public Announcement Logic: An Alternative Approach to Some AI Puzzles
In the paper we present a dynamic model of knowledge. The model is inspired by public announcement logic and an approach to a puzzle concerning knowledge and communication using th...
Pawel Garbacz, Piotr Kulicki, Marek Lechniak, Robe...