Skip to main content

Modeling Administrative Discretion Using Goal-Directed Answer Set Programming

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (CAEPIA 2021)

Abstract

Automated legal reasoning and its application in smart contract is getting interest. In this context, ethical and legal concerns make it necessary for automated reasoners to justify in human-understandable terms the advice given. Logic Programming, specially Answer Set Programming, has a rich semantics and has been used to very concisely express complex knowledge. However, modelling vague concepts such as ambiguity and discretion cannot be expressed in top-down execution models based on Prolog, and in bottom-up execution models based on ASP the justifications are incomplete and/or not scalable. We propose to use s(CASP), a top-down execution model for predicate ASP, to model ambiguity and discretion following a set of patterns. We have implemented a framework, called s(LAW), to model, reason, and justify the applicable legislation and validate it by translating (and benchmarking) the criteria for the admission of students in public centers established by the “Comunidad de Madrid”.

This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities, co-funded by EU FEDER Funds, through project grant InEDGEMobility RTI2018-095390-B-C33 (MCIU/AEI/FEDER, UE).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Organic Law 2/2006, May 3, last modified by Organic Law 3/2020, December 29.

  2. 2.

    Decree 29/2013, of April 11, modified by Decree 11/2019, of March 5, of the Governing Council, on freedom of choice respecting school centers; Order 1240/2013, of April 17, of the Department of Education, Youth and Sports of Community of Madrid, modified by Order 1534/2019, of May 17, of the Department of Education and Research Community of Madrid; Resolution of July 31, 2013, of the General Directorate for the Improvement of the Quality of Education (regarding bilingual education); and Joint Resolution of the Deputy Department of Educational Policy and Educational Organization, of February 18, 2021 (https://bit.ly/3dAX22d).

  3. 3.

    On January 14\(^{th}\), 2021, Dr. Robert Kowalski explained how they bypassed in [14] the representation of vague concepts such as without undue delay [8, 1:20:15, 1:26:00].

References

  1. Arias, J., Carro, M., Salazar, E., Marple, K., Gupta, G.: Constraint answer set programming without grounding. Theory Pract. Logic Program. 18(3–4), 337–354 (2018). https://doi.org/10.1017/S1471068418000285

    Article  MathSciNet  MATH  Google Scholar 

  2. Cabalar, P., Fandinno, J., Fink, M.: Causal graph justifications of logic programs. Theory Pract. Logic Program. 14(4–5), 603–618 (2014). https://doi.org/10.1017/S1471068414000234

    Article  MathSciNet  MATH  Google Scholar 

  3. Cobbe, J.: Administrative law and the machines of government: judicial review of automated public-sector decision-making. Legal Stud. 39(4), 636–655 (2019)

    Article  Google Scholar 

  4. DARPA: Explainable Artificial Intelligence (XAI). Defense Advanced Research Projects Agency (2017). https://www.darpa.mil/program/explainable-artificial-intelligence

  5. Gelder, A.V., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38, 620–650 (1991). https://doi.org/10.1145/116825.116838

    Article  MathSciNet  MATH  Google Scholar 

  6. Gelfond, M.: Logic programming and reasoning with incomplete information. Ann. Math. Artif. Intell. 12(1), 89–116 (1994)

    Article  MathSciNet  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: 5th International Conference on Logic Programming, pp. 1070–1080 (1988). http://www.cse.unsw.edu.au/~cs4415/2010/resources/stable.pdf, https://bit.ly/3fGDie6

  8. Kowalski, R.A.: Logical English = Logic + English + Compupting, HackReason Opening Ceremony, January 2021. https://utdallas.app.box.com/s/ngsyloscj5sk24uh3axexxz451o74z0u. Accessed 19 Apr 2021

  9. Marple, K., Salazar, E., Gupta, G.: computing stable models of normal logic programs without grounding. arXiv 1709.00501 (2017). http://arxiv.org/abs/1709.00501

  10. Cerrillo i Martínez, A.: El derecho para una inteligencia artificial centrada en el ser humano y al servicio de las instituciones: Presentación del monográfico. IDP: Revista de Internet, Derecho y Politica (30) (2019)

    Google Scholar 

  11. Pontelli, E., Son, T.C., El-Khatib, O.: Justifications for logic programs under answer set semantics. Theory Pract. Logic Program. 9(1), 1–56 (2009). https://doi.org/10.1017/S1471068408003633

    Article  MathSciNet  MATH  Google Scholar 

  12. Ramakrishna, S., Górski, Ł, Paschke, A.: A dialogue between a lawyer and computer scientist: the evaluation of knowledge transformation from legal text to computer-readable format. Appl. Artif. Intell. 30(3), 216–232 (2016)

    Article  Google Scholar 

  13. Schulz, C., Toni, F.: Justifying answer sets using argumentation. Theory Pract. Logic Program. 16(1), 59–110 (2016). https://doi.org/10.1017/S1471068414000702

    Article  MathSciNet  MATH  Google Scholar 

  14. Sergot, M.J., Sadri, F., Kowalski, R.A., Kriwaczek, F., Hammond, P., Cory, H.T.: The British nationality act as a logic program. Commun. ACM 29(5), 370–386 (1986)

    Article  Google Scholar 

  15. Solé, J.P.: Inteligencia artificial, derecho administrativo y reserva de humanidad: algoritmos y procedimiento administrativo debido tecnológico. Revista general de Derecho administrativo 50 (2019)

    Google Scholar 

  16. Swift, T., Warren, D.S.: XSB: extending prolog with tabled logic programming. Theory Pract. Logic Program. 12(1–2), 157–187 (2012). https://doi.org/10.1017/S1471068411000500

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joaquín Arias .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Arias, J., Moreno-Rebato, M., Rodriguez-García, J.A., Ossowski, S. (2021). Modeling Administrative Discretion Using Goal-Directed Answer Set Programming. In: Alba, E., et al. Advances in Artificial Intelligence. CAEPIA 2021. Lecture Notes in Computer Science(), vol 12882. Springer, Cham. https://doi.org/10.1007/978-3-030-85713-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85713-4_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85712-7

  • Online ISBN: 978-3-030-85713-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics