764 search results - page 94 / 153 » On the Expressibility of Stable Logic Programming |
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
100
click to vote
ICFP
2007
ACM
15 years 11 months ago
2007
ACM
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
126
click to vote
SP
2000
IEEE
15 years 4 months ago
2000
IEEE
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
102
click to vote
ICSE
1997
IEEE-ACM
15 years 4 months ago
1997
IEEE-ACM
—Most analysis methods for real-time systems assume that all the components of the system are at roughly the same stage of development and can be expressed in a single notation, ...