Computable Functions in ASP: Theory and Implementation
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The finite grounding restriction is often achieved by enforcing syntactic restrictions on programs, such as finitely-ground programs.
“This finite grounding restriction is often achieved by enforcing syntactic restrictions on the programs, such as finitely-ground programs Calimeri et al. (2008).”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Calimeri et al. (2008)
Cites
(1988) · Cited by 3,452 · see citing works
A lattice-theoretical fixpoint theorem and its applications
Tarski, A. (1955) · Pacific Journal of Mathematics · doi:10.2140/pjm.1955.5.285 · Cited by 2,745 · see citing works
Classical negation in logic programs and disjunctive databases
Gelfond, M., & Lifschitz, V. (1991) · New Generation Computing · doi:10.1007/bf03037169 · Cited by 2,267 · see citing works
Apt, K. R. (1992) · Cited by 1,678 · see citing works
Lecture Notes in Computer Science 1867
Baldwin, J., Martin, T., & Tzanavari, A. (2000) · Cited by 1,629 · see citing works
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. R. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,443 · see citing works
The DLV system for knowledge representation and reasoning
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1149114.1149117 · Cited by 1,152 · see citing works
Self-citationMonodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
Hodkinson, I., Wolter, F., & Zakharyaschev, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45653-8_1 · Cited by 961 · see citing works
Extending and implementing the stable model semantics
Simons, P., Niemelä, I., & Soininen, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00187-x · Cited by 844 · see citing works
Stable Models and an Alternative Logic Programming Paradigm
Marek, V. W., & Truszczyński, M. (1999) · Artificial intelligence · doi:10.1007/978-3-642-60085-2_17 · Cited by 745 · see citing works
A logical language for data and knowledge bases
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0349 · Cited by 351 · see citing works
Lifschitz, V. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46767-x_28 · Cited by 304 · see citing works
Termination of logic programs: the never-ending story
Schreye, D. D., & Decorte, S. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90027-2 · Cited by 208 · see citing works
Omega-Restricted Logic Programs
Syrjänen, T. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45402-0_20 · Cited by 94 · see citing works
Reasoning with infinite stable models
Bonatti, P. A. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2004.02.001 · Cited by 88 · see citing works
The First Answer Set Programming System Competition
Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T. H., & Truszczyński, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-72200-7_3 · Cited by 83 · see citing works
Termination analysis of logic programs through combination of type-based norms
Bruynooghe, M., Codish, M., Gallagher, J. P., Genaim, S., & Vanhoof, W. (2007) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1216374.1216378 · Cited by 68 · see citing works
Norms on terms and their use in proving universal termination of a logic program
Bossi, A., Cocco, N., & Fabris, M. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(92)00019-n · Cited by 57 · see citing works
External sources of knowledge and value invention in logic programming
Calimeri, F., Cozza, S., & Ianni, G. (2007) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-007-9076-z · Cited by 52 · see citing works
Self-citationAnswer set programming with functions
Lin, F., & Wang, Y. (2008) · Cited by 35 · see citing works
$\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
Šimkus, M., & Eiter, T. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-75560-9_37 · Cited by 35 · see citing works
On Finitely Recursive Programs
Baselice, S., Bonatti, P. A., & Criscuolo, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-74610-2_7 · Cited by 19 · see citing works
Reasoning with Infinite Stable Models II: Disjunctive Programs
Bonatti, P. A. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45619-8_23 · Cited by 16 · see citing works
Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111]
Bonatti, P. A. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.07.002 · Cited by 8 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Answer set programming at a glance
Brewka, G., Eiter, T., & Truszczyński, M. (2011) · Communications of the ACM · doi:10.1145/2043174.2043195 · Cited by 946 · see citing works
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00457ed1v01y201211aim019 · Cited by 325 · see citing works
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2013) · Synthesis lectures on artificial intelligence and machine learning · doi:10.1007/978-3-031-01561-8 · Cited by 306 · see citing works
Answer Set Programming: A Primer
Eiter, T., Ianni, G., & Krennwallner, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03754-2_2 · Cited by 191 · see citing works
Self-citationAdaptive socio-technical systems: a requirements-based approach
Dalpiaz, F., Giorgini, P., & Mylopoulos, J. (2011) · Requirements Engineering · doi:10.1007/s00766-011-0132-1 · Cited by 142 · see citing works
Liang, S., Fodor, P., Wan, H., & Kifer, M. (2009) · International World Wide Web Conference (WWW) · doi:10.1145/1526709.1526790 · Cited by 112 · see citing works
Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
Grau, B. C., Horrocks, I. R., Krötzsch, M., Kupke, C., Magka, D., Motik, B., & Wang, Z. (2013) · Cited by 85 · see citing works
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83 · see citing works
Grounding and Solving in Answer Set Programming
Kaufmann, B., Leone, N., Perri, S., & Schaub, T. H. (2016) · AI Magazine · doi:10.1609/aimag.v37i3.2672 · Cited by 70 · see citing works
Self-citationAcyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
Grau, B. C., Horrocks, I. R., Krötzsch, M., Kupke, C., Magka, D., Motik, B., & Wang, Z. (2013) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3949 · Cited by 61 · see citing works
The Disjunctive Datalog System DLV
Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., & Giorgio Terracina, B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-24206-9_17 · Cited by 60 · see citing works
Self-citationAn Architecture for Requirements-Driven Self-reconfiguration
Dalpiaz, F., Giorgini, P., & Mylopoulos, J. (2009) · Notes on numerical fluid mechanics and multidisciplinary design · doi:10.1007/978-3-642-02144-2_22 · Cited by 60 · see citing works
One More Decidable Class of Finitely Ground Programs
Lierler, Y., & Lifschitz, V. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02846-5_40 · Cited by 54 · see citing works
Argumentation and Answer Set Programming
Toni, F., & Sergot, M. J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20832-4_11 · Cited by 48 · see citing works
Lee, J., & Palla, R. (2012) · Journal of Artificial Intelligence Research · doi:10.1613/jair.3489 · Cited by 48 · see citing works
Bonatti, P. A., Calimeri, F., Leone, N., & Ricca, F. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14309-0_8 · Cited by 46 · see citing works
Self-citationA model building framework for answer set programming with external computations
Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Redl, C., & Schüller, P. (2015) · Theory and Practice of Logic Programming · doi:10.1017/s1471068415000113 · Cited by 46 · see citing works
Self-citationConstraint answer set solver EZCSP and why integration schemas matter
Balduccini, M., & Lierler, Y. (2017) · Theory and Practice of Logic Programming · doi:10.1017/s1471068417000102 · Cited by 44 · see citing works
Database Repairs and Consistent Query Answering
Bertossi, L. (2019) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3294052.3322190 · Cited by 43 · see citing works
The First Version of a New ASP Solver : ASPeRiX
Lefèvre, C., & Nicolas, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_52 · Cited by 42 · see citing works
The ASP System DLV: Advancements and Applications
Adrian, W. T., Alviano, M., Calimeri, F., Cuteri, B., Dodaro, C., Faber, W., Fuscà, D., Leone, N., Manna, M., Perri, S., et al. (2018) · Künstliche Intell. · doi:10.1007/s13218-018-0533-0 · Cited by 42 · see citing works
Self-citationHybrid Reasoning with Rules and Ontologies
Drabent, W., Eiter, T., Ianni, G., Krennwallner, T., Lukasiewicz, T., & Małuszyński, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04581-3_1 · Cited by 38 · see citing works
Self-citationASP at Work: Spin-off and Applications of the DLV System
Grasso, G., Leone, N., Manna, M., & Ricca, F. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20832-4_27 · Cited by 34 · see citing works
Self-citationOn finitely recursive programs
Baselice, S., Bonatti, P. A., & Criscuolo, G. (2009) · Theory and Practice of Logic Programming · doi:10.1017/s147106840900372x · Cited by 34 · see citing works
The Intelligent Grounder of DLV
Faber, W., Leone, N., & Perri, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30743-0_17 · Cited by 31 · see citing works
Self-citationDisjunctive ASP with functions: Decidable queries and effective computation
Alviano, M., Faber, W., & Leone, N. (2010) · University of Huddersfield Repository (University of Huddersfield) · Cited by 29 · see citing works
Self-citationAutomata for infinite argumentation structures
Baroni, P., Cerutti, F., Dunne, P. E. S., & Giacomin, M. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2013.05.002 · Cited by 26 · see citing works
Extending Acyclicity Notions for Existential Rules
Baget, J.-F., Garreau, F., Mugnier, M.-L., & Rocher, S. (2014) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-61499-419-0-39 · Cited by 26 · see citing works
An ASP System with Functions, Lists, and Sets
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_46 · Cited by 23 · see citing works
Self-citationCollaborative Schema Matching Reconciliation
Nguyen, Q. V. H., Luong, X. H., Miklós, Z., Quan, T., & Aberer, K. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41030-7_14 · Cited by 22 · see citing works
A First Order Forward Chaining Approach for Answer Set Computing
Lefèvre, C., & Nicolas, P. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_18 · Cited by 22 · see citing works
Domain expansion for ASP-programs with external sources
Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2016) · Artificial Intelligence · doi:10.1016/j.artint.2016.01.003 · Cited by 22 · see citing works
Logic programs with intensional functions
Lifschitz, V. (2012) · Cited by 21 · see citing works
Declarative entity resolution via matching dependencies and answer set programs
Bahmani, Z., Bertossi, L., Kolahi, S., & Lakshmanan, L. V. S. (2012) · Principles of Knowledge Representation and Reasoning · Cited by 20 · see citing works
On Finitely Recursive Programs
Baselice, S., Bonatti, P. A., & Criscuolo, G. (2007) · Springer eBooks · doi:10.1007/978-3-540-74610-2_7 · Cited by 19 · see citing works
Synonymous theories and knowledge representations in answer set programming
Pearce, D., & Valverde, A. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2011.02.013 · Cited by 17 · see citing works
Greco, S., Molinaro, C., & Trubitsyna, I. (2013) · Theory and Practice of Logic Programming · doi:10.1017/s147106841300046x · Cited by 17 · see citing works
Bidirectional answer set programs with function symbols
Eiter, T., & Šimkus, M. (2009) · Cited by 17 · see citing works
What is answer set programming to propositional satisfiability
Lierler, Y. (2016) · Constraints · doi:10.1007/s10601-016-9257-7 · Cited by 16 · see citing works
Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
Eiter, T., Fink, M., Ianni, G., Krennwallner, T., & Schüller, P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9_10 · Cited by 15 · see citing works
Self-citationASPeRiX, a First Order Forward Chaining Approach for Answer Set ComputingPreprint
Lefèvre, C., Béatrix, C., Stéphan, I., & Garcia, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.07717 · Cited by 15 · see citing works
A Prototype of a Knowledge-Based Programming Environment
Pooter, S. D., Wittocx, J., & Denecker, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-41524-1_16 · Cited by 14 · see citing works
Liberal Safety for Answer Set Programs with External Sources
Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2013) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v27i1.8571 · Cited by 14 · see citing works
Bertossi, L. (2020) · Knowledge and Information Systems · doi:10.1007/s10115-020-01516-6 · Cited by 14 · see citing works
Enhancing ASP by Functions: Decidable Classes and Implementation Techniques
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7702 · Cited by 14 · see citing works
Self-citationA decidable subclass of finitary programs
Baselice, S., & Bonatti, P. A. (2010) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000232 · Cited by 13 · see citing works
Bounded programs: a new decidable class of logic programs with function symbols
Greco, S., Molinaro, C., & Trubitsyna, I. (2013) · Cited by 12 · see citing works
Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approaches
Lierler, Y. (2021) · Theory and Practice of Logic Programming · doi:10.1017/s1471068421000478 · Cited by 11 · see citing works
The DLV Project: A Tour from Theory and Research to Applications and Market
Leone, N., & Faber, W. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89982-2_10 · Cited by 12 · see citing works
Self-citationChecking termination of bottom-up evaluation of logic programs with function symbols
Calautti, M., Greco, S., Spezzano, F., & Trubitsyna, I. (2014) · Theory and Practice of Logic Programming · doi:10.1017/s1471068414000623 · Cited by 12 · see citing works
Incremental maintenance of overgrounded logic programs with tailored simplifications
Ianni, G., Pacenza, F., & Zangari, J. (2020) · Theory and Practice of Logic Programming · doi:10.1017/s147106842000040x · Cited by 12 · see citing works
Self-citationA Decidable Class of Groundable Formulas in the General Theory of Stable Models
Bartholomew, M., & Lee, J. (2010) · Cited by 11 · see citing works
Detecting decidable classes of finitely ground logic programs with function symbols
Calautti, M., Greco, S., & Trubitsyna, I. (2013) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/2505879.2505883 · Cited by 11 · see citing works
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_9 · Cited by 11 · see citing works
Self-citationRevisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic NegationPreprint
Baget, J.-F., Garreau, F., Mugnier, M.-L., & Rocher, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.1071 · Cited by 11 · see citing works
Logic Programming and Logarithmic Space
Aubert, C., Bagnol, M., Pistone, P., & Seiller, T. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12736-1_3 · Cited by 10 · see citing works
Terminating Evaluation of Logic Programs with Finite Three-Valued Models
Riguzzi, F., & Swift, T. (2014) · ACM Transactions on Computational Logic · doi:10.1145/2629337 · Cited by 10 · see citing works
Mitra, A., Clark, P. E., Tafjord, O., & Baral, C. R. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013003 · Cited by 8 · see citing works
On the Foundations of Grounding in Answer Set Programming
Kaminski, R., & Schaub, T. H. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000308 · Cited by 8 · see citing works
Cabalar, P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20832-4_21 · Cited by 8 · see citing works
A Free Logic for Stable Models with Partial Intensional Functions
Cabalar, P., del Cerro, L. F., Pearce, D., & Valverde, A. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-11558-0_24 · Cited by 8 · see citing works
Finitely recursive programs: Decidability and bottom–up computation
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2011) · AI Communications · doi:10.3233/aic-2011-0509 · Cited by 8 · see citing works
Self-citationLogic program termination analysis using atom sizes
Calautti, M., Greco, S., Molinaro, C., & Trubitsyna, I. (2015) · Institutional Research Information System (Università degli Studi di Trento) · Cited by 7 · see citing works
Automatic Program Rewriting in Non-Ground Answer Set Programs
Hippen, N., & Lierler, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-05998-9_2 · Cited by 7 · see citing works
On the Application of the Answer Set Programming System DLV in Industry: a Report from the Field
Calimeri, F., & Ricca, F. (2012) · Cited by 7 · see citing works
Self-citationChecking Termination of Logic Programs with Function Symbols through Linear Constraints
Calautti, M., Greco, S., Molinaro, C., & Trubitsyna, I. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-09870-8_7 · Cited by 7 · see citing works
Dialectical Proofs for Constrained Argumentation
Devred, C., Doutre, S., Lefèvre, C., & Nicolas, P. (2010) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-60750-619-5-159 · Cited by 7 · see citing works
Exploiting Contextual and Social Variability for Software Adaptation
Dalpiaz, F. (2011) · Unitn-eprints PhD (University of Trento) · doi:10.15168/11572_368676 · Cited by 7 · see citing works
A prototype of a knowledge-based programming environmentPreprint
Pooter, S. D., Wittocx, J., & Denecker, M. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1108.5667 · Cited by 7 · see citing works
On relation between constraint answer set programming and satisfiability modulo theories
Lierler, Y., & Susman, B. (2017) · Theory and Practice of Logic Programming · doi:10.1017/s1471068417000114 · Cited by 6 · see citing works
Weight Constraint Programs with Functions
Wang, Y., You, J.-H., Yuan, L.-Y., & Zhang, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_28 · Cited by 5 · see citing works
Weight constraint programs with evaluable functions
Wang, Y., You, J.-H., Lin, F., Yuan, L. Y., & Zhang, M. (2010) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-011-9237-y · Cited by 5 · see citing works
Riguzzi, F., & Swift, T. (2010) · Institutional Research Information System University of Ferrara (University of Ferrara) · Cited by 5 · see citing works
An Introduction to Answer Set Programming and Some of Its Extensions
Faber, W. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-60067-9_6 · Cited by 5 · see citing works
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
Calautti, M., Greco, S., & Trubitsyna, I. (2017) · ACM Transactions on Computational Logic · doi:10.1145/3143804 · Cited by 5 · see citing works
Bertossi, L., & Reyes, G. D. L. Á. D. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-97454-1_4 · Cited by 5 · see citing works
Faber, W. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-39784-4_4 · Cited by 4 · see citing works
Query Answering with Guarded Existential Rules under Stable Model Semantics
Wan, H., Xiao, G., Wang, C., Liu, X., Chen, J., & Wang, Z. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i03.5695 · Cited by 4 · see citing works
Argumentation-based schema matching for multiple digital libraries
Quan, T., Luong, X. H., Nguyen, T., & Cheung, H. S. (2015) · Online Information Review · doi:10.1108/oir-02-2014-0023 · Cited by 4 · see citing works
Baget, J.-F., Garcia, L., Garreau, F., Lefèvre, C., Rocher, S., & Stéphan, I. (2017) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-017-9563-9 · Cited by 4 · see citing works
Bridging the gap between classical logic based formalisms and logic programs
Lee, J., & Palla, R. (2012) · Cited by 3 · see citing works
Intelligent Instantiation and Supersafe Rules
Lifschitz, V. (2016) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/oasics.iclp.2016.7 · Cited by 3 · see citing works
Bertossi, L. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-95481-9_7 · Cited by 3 · see citing works
Lallouet, A., Moinard, Y., Nicolas, P., & Stéphan, I. (2020) · Springer eBooks · doi:10.1007/978-3-030-06167-8_4 · Cited by 3 · see citing works
Enfragmo: A System for Grounding Extended First-Order Logic to SAT
Aavani, A. (2014) · Summit (Simon Fraser University) · Cited by 3 · see citing works
Termination of Grounding Is Not Preserved by Strongly Equivalent Transformations
Lierler, Y., & Lifschitz, V. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9_20 · Cited by 3 · see citing works
Reconciling Schema Matching Networks
Nguyen, Q. V. H. (2014) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-6033 · Cited by 3 · see citing works
Eiter, T., Ortiz, M., & Šimkus, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89439-1_27 · Cited by 3 · see citing works
On finitely recursive programsPreprint
Baselice, S., Bonatti, P. A., & Criscuolo, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.2850 · Cited by 3 · see citing works
Fusion of Logic Programming and Description Logics
Šimkus, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02846-5_59 · Cited by 2 · see citing works
Towards a Type Discipline for Answer Set Programming
Fiorentini, C., Momigliano, A., & Ornaghi, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02444-3_8 · Cited by 2 · see citing works
Riguzzi, F., & Swift, T. (2012) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000664 · Cited by 2 · see citing works
Using linear constraints for logic program termination analysis
Calautti, M., Greco, S., MOLINARO, C., & Trubitsyna, I. (2016) · Theory and Practice of Logic Programming · doi:10.1017/s1471068416000077 · Cited by 2 · see citing works
Implementing Courcelle's Theorem in a declarative framework for dynamic programming
Bliem, B., Pichler, R., & Woltran, S. (2016) · Journal of Logic and Computation · doi:10.1093/logcom/exv089 · Cited by 2 · see citing works
Reasoning in the presence of inconsistency through Preferential ALC
Deane, G., Broda, K. B., & Russo, A. (2018) · EPiC series in computing · doi:10.29007/8qr4 · Cited by 2 · see citing works
Simulating Sets in Answer Set Programming
Gaggl, S. A., Hanisch, P. T., & Krötzsch, M. (2022) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2022/365 · Cited by 2 · see citing works
On the complexity of index sets for finite predicate logic programs which allow function symbols
Cenzer, D., Marek, V. W., & Remmel, J. B. (2020) · Journal of Logic and Computation · doi:10.1093/logcom/exaa005 · Cited by 1 · see citing works
Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
Cenzer, D., Marek, V. W., & Remmel, J. B. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-27683-0_5 · Cited by 1 · see citing works
An Infrastructure for Multi-shot Reasoning with Incremental Grounding.
Ianni, G., Pacenza, F., & Zangari, J. (2019) · CILC · Cited by 1 · see citing works
Self-citation
- Authors
- Calimeri, F., Cozza, S., Ianni, G., & Leone, N.
- Affiliations
- University of Calabria (IT)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008
- Pages
- 407-424
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1484110122
- Cited by
- 120
- References
- 24
- Citations by year
- 2025: 1 · 2024: 1 · 2022: 5 · 2021: 1 · 2020: 8 · 2019: 7 · 2018: 3 · 2017: 6 · 2016: 6 · 2015: 7 · 2014: 13 · 2013: 12 · 2012: 9
- FWCI
- 9.91
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Archive of Doctoral Theses and Digital Collections (University of Calabria) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
- Keywords
- answer set programming, disjunctive logic programming, recursive functions, decidability, semi-decidability, built-in functions, termination, knowledge representation and reasoning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
