Result 1 to 20 of 269 total
An approximative inference method for solving $\exists \forall \mathrm{SO}$ satisfiability problems. (English)
J. Artif. Intell. Res. (JAIR) 45, 79-124 (2012).
1
Approximation fixpoint theory and the semantics of logic and answers set programs. (English)
Erdem, Esra (ed.) et al., Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz. Berlin: Springer (ISBN 978-3-642-30742-3/pbk). Lecture Notes in Computer Science 7265, 178-194 (2012).
2
The magic of logical inference in probabilistic programming. (English)
Theory Pract. Log. Program. 11, No. 4-5, 663-680 (2011).
3
Answer set programming’s contributions to classical logic. An analysis of ASP methodology. (English)
Balduccini, Marcello (ed.) et al., Logic programming, knowledge representation, and nonmonotonic reasoning. Essays dedicated to Michael Gelfond on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-20831-7/pbk). Lecture Notes in Computer Science 6565. Lecture Notes in Artificial Intelligence, 12-32 (2011).
4
Answer set programming’s contributions to classical logic - an analysis of ASP methodology (English)
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 12-32 (2011).
5
ProbLog technology for inference in a probabilistic First Order Logic. (English)
Coelho, Helder (ed.) et al., ECAI 2010. 19th European conference on artificial intelligence, August 16‒20, 2010 Lisbon, Portugal. Including proceedings of the 6th prestigious applications of artificial intelligence (PAIS-2010). Amsterdam: IOS Press (ISBN 978-1-60750-605-8/pbk; 978-1-60750-606-5/ebook). Frontiers in Artificial Intelligence and Applications 215, 719-724 (2010).
6
FO(ID) as an extension of DL with rules. (English)
Ann. Math. Artif. Intell. 58, No. 1-2, 85-115 (2010).
7
A comparison of pruning criteria for probability trees. (English)
Mach. Learn. 78, No. 1-2, 251-285 (2010).
8
An approximative inference method for solving $\exists \forall $SO satisfiability problems. (English)
Janhunen, Tomi (ed.) et al., Logics in artificial intelligence. 12th European conference, JELIA 2010, Helsinki, Finland, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15674-8/pbk). Lecture Notes in Computer Science 6341. Lecture Notes in Artificial Intelligence, 326-338 (2010).
9
Embracing events in causal modelling: interventions and counterfactuals in CP-logic. (English)
Janhunen, Tomi (ed.) et al., Logics in artificial intelligence. 12th European conference, JELIA 2010, Helsinki, Finland, September 13‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15674-8/pbk). Lecture Notes in Computer Science 6341. Lecture Notes in Artificial Intelligence, 313-325 (2010).
10
A transformational approach for proving properties of the CHR constraint store. (English)
De Schreye, Danny (ed.), Logic-based program synthesis and transformation. 19th international symposium, LOPSTR 2009, Coimbra, Portugal, September 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-12591-1/pbk). Lecture Notes in Computer Science 6037, 22-36 (2010).
11
Towards a logical reconstruction of a theory for locally closed databases (English)
ACM Trans. Database Syst. 35, No. 3 (2010).
12
Prediction of clinical conditions after coronary bypass surgery using dynamic data analysis (English)
J. Medical Systems 34, No. 3, 229-239 (2010).
13
Experience with widening based equivalence checking in realistic multimedia systems (English)
J. Electronic Testing 26, No. 2, 279-292 (2010).
14
Problog technology for inference in a probabilistic first order logic (English)
ECAI, 719-724 (2010).
15
Embracing events in causal modelling: interventions and counterfactuals in CP-logic (English)
JELIA, 313-325 (2010).
16
An approximative inference method for solving THERE EXISTS FOR ALL SO satisfiability problems (English)
JELIA, 326-338 (2010).
17
CP-logic: A language of causal probabilistic events and its relation to logic programming. (English)
Comput. Res. Repos. 2009, Article No. 0904.1672 (2009).
18
CP-logic: A language of causal probabilistic events and its relation to logic programming. (English)
Theory Pract. Log. Program. 9, No. 3, 245-308 (2009).
19
Equivalence checking of static affine programs using widening to handle recurrences. (English)
Bouajjani, Ahmed (ed.) et al., Computer aided verification. 21st international conference, CAV 2009, Grenoble, France, June 26‒July 2, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02657-7/pbk). Lecture Notes in Computer Science 5643, 599-613 (2009).
20
Result 1 to 20 of 269 total
Start
Contact
Print
General Help
