Sciweavers

100 search results - page 2 / 20
» Logic Programs with Abstract Constraint Atoms: The Role of C...
Sort
View
AAAI
2008
13 years 7 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
LPNMR
2009
Springer
13 years 11 months ago
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
Yi-Dong Shen, Jia-Huai You
CONCUR
2009
Springer
13 years 11 months ago
Perspectives on Transactional Memory
Abstract. We examine the role of transactional memory from two perspectives: that of a programming language with atomic actions and that of implementations of the language. We argu...
Martín Abadi, Tim Harris
CORR
2002
Springer
117views Education» more  CORR 2002»
13 years 4 months ago
Computing stable models: worst-case performance estimates
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
Zbigniew Lonc, Miroslaw Truszczynski
ASP
2003
Springer
13 years 10 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke