90 search results - page 4 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
ICALP
1998
Springer
14 years 23 days ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
FOSSACS
1999
Springer
14 years 25 days ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
IJCAI
2007
13 years 10 months ago
2007
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...
ASP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
LPNMR
2007
Springer
2007
Springer
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
14 years 2 months ago
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 ...