|
Search the dblp DataBase
Emilia Oikarinen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Emilia Oikarinen, Tomi Janhunen
Modular Equivalence for Normal Logic Programs. [Citation Graph (0, 0)][DBLP] ECAI, 2006, pp:412-416 [Conf]
- Tomi Janhunen, Emilia Oikarinen
Testing the Equivalence of Logic Programs under Stable Model Semantics. [Citation Graph (0, 0)][DBLP] JELIA, 2002, pp:493-504 [Conf]
- Tomi Janhunen, Emilia Oikarinen
Capturing Parallel Circumscription with Disjunctive Logic Programs. [Citation Graph (0, 0)][DBLP] JELIA, 2004, pp:134-146 [Conf]
- Tomi Janhunen, Emilia Oikarinen
LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. [Citation Graph (0, 0)][DBLP] LPNMR, 2004, pp:336-340 [Conf]
- Emilia Oikarinen, Tomi Janhunen
Verifying the Equivalence of Logic Programs in the Disjunctive Case. [Citation Graph (0, 0)][DBLP] LPNMR, 2004, pp:180-193 [Conf]
- Emilia Oikarinen, Tomi Janhunen
circ2dlp - Translating Circumscription into Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP] LPNMR, 2005, pp:405-409 [Conf]
- Tomi Janhunen, Emilia Oikarinen, Hans Tompits, Stefan Woltran
Modularity Aspects of Disjunctive Stable Models. [Citation Graph (0, 0)][DBLP] LPNMR, 2007, pp:175-187 [Conf]
- Emilia Oikarinen
Modularity in smodelsPrograms. [Citation Graph (0, 0)][DBLP] LPNMR, 2007, pp:321-326 [Conf]
- Matti Järvisalo, Emilia Oikarinen
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs. [Citation Graph (0, 0)][DBLP] ICLP, 2007, pp:134-148 [Conf]
- Emilia Oikarinen
Modular Answer Set Programming. [Citation Graph (0, 0)][DBLP] ICLP, 2007, pp:462-463 [Conf]
- Emilia Oikarinen, Tomi Janhunen
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming. [Citation Graph (0, 0)][DBLP] ICLP, 2007, pp:440-441 [Conf]
- Tomi Janhunen, Emilia Oikarinen
Automated verification of weak equivalence within the SMODELS system [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal]
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models. [Citation Graph (, )][DBLP]
Characterizing Strong Equivalence for Argumentation Frameworks. [Citation Graph (, )][DBLP]
A Module-Based Framework for Multi-language Constraint Modeling. [Citation Graph (, )][DBLP]
Max-ASP: Maximum Satisfiability of Answer Set Programs. [Citation Graph (, )][DBLP]
Extended ASP tableaux and rule redundancy in normal logic programs [Citation Graph (, )][DBLP]
Achieving compositionality of the stable model semantics for Smodels programs [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|