Sciweavers

461 search results - page 3 / 93
» Component-Based Answer Set Programming
Sort
View
AAAI
2010
13 years 5 months ago
First-Order Indefinability of Answer Set Programs on Finite Structures
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...
Yin Chen, Yan Zhang, Yi Zhou
FOIKS
2008
Springer
13 years 6 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LPNMR
2009
Springer
13 years 11 months ago
Translating Preferred Answer Set Programs to Propositional Logic
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
Vernon Asuncion, Yan Zhang
ECBS
2007
IEEE
142views Hardware» more  ECBS 2007»
13 years 11 months ago
Model-Driven Engineering for Development-Time QoS Validation of Component-Based Software Systems
Model-driven engineering (MDE) techniques are increasingly being used to address many of the development and operational lifecycle concerns of large-scale component-based systems....
James H. Hill, Sumant Tambe, Aniruddha S. Gokhale
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
13 years 7 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...