1<!DOCTYPE html> 2<html> 3 4 <head> 5 <meta charset="utf-8"> 6<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no"> 7<meta http-equiv="X-UA-Compatible" content="IE=edge"> 8 9<title>Valentin Cassano | publications</title> 10<meta name="description" content="Phd. Computer Science. Researcher at CONICET. Professor at the Department of Mathematics, University of Rio Cuarto. 11"> 12 13<!-- Bootstrap & MDB --> 14<link href="https://stackpath.bootstrapcdn.com/bootstrap/4.4.1/css/bootstrap.min.css" rel="stylesheet" integrity="sha384-Vkoo8x4CGsO3+Hhxv8T/Q5PaXtkKtu6ug5TOeNV6gBiFeWPGFN9MuhOf23Q9Ifjh" crossorigin="anonymous"> 15<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/mdbootstrap/4.17.0/css/mdb.min.css" integrity="sha256-/SwJ2GDcEt5382i8zqDwl36VJGECxEoIcBIuoLmLR4g=" crossorigin="anonymous" /> 16 17<!-- Fonts & Icons --> 18<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/font-awesome/5.13.0/css/all.min.css" integrity="sha256-h20CPZ0QyXlBuAw7A+KluUYx/3pK+c7lYEpqLTlxjYQ=" crossorigin="anonymous"> 19<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/academicons/1.8.6/css/academicons.min.css" integrity="sha256-uFVgMKfistnJAfoCUQigIl+JfUaP47GrRKjf6CTPVmw=" crossorigin="anonymous"> 20<link rel="stylesheet" type="text/css" href="https://fonts.googleapis.com/css?family=Roboto:300,400,500,700|Roboto+Slab:100,300,400,500,700|Material+Icons"> 21 22<!-- Styles --> 23<link rel="shortcut icon" href="/assets/img/favicon.ico"> 24<link rel="stylesheet" href="/assets/css/main.css"> 25 26<link rel="canonical" href="/publications/"> 27 28<!-- Open Graph --> 29 30 31 </head> 32 33 <body class="fixed-top-nav "> 34 35 <!-- Header --> 36 37 <header> 38 39 <!-- Nav Bar --> 40 <nav id="navbar" class="navbar navbar-light bg-white navbar-expand-sm fixed-top"> 41 <div class="container"> 42 43 44 45 46 47 48 49 50 51 52 53 <a class="navbar-brand title font-weight-lighter" href="https://vcassano.github.io/"> 54 <span class="font-weight-bold">Valentin</span> Cassano 55 </a> 56 57 58 59 60 61 <!-- Navbar Toogle --> 62 <button class="navbar-toggler collapsed ml-auto" type="button" data-toggle="collapse" data-target="#navbarNav" aria-controls="navbarNav" aria-expanded="false" aria-label="Toggle navigation"> 63 <span class="sr-only">Toggle navigation</span> 64 <span class="icon-bar top-bar"></span> 65 <span class="icon-bar middle-bar"></span> 66 <span class="icon-bar bottom-bar"></span> 67 </button> 68 <div class="collapse navbar-collapse text-right" id="navbarNav"> 69 <ul class="navbar-nav ml-auto flex-nowrap"> 70 71 <!-- About --> 72 <li class="nav-item "> 73 <a class="nav-link" href="/"> 74 about 75 76 </a> 77 </li> 78 79 <!-- Other pages --> 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 <li class="nav-item active"> 101 <a class="nav-link" href="/publications/"> 102 publications 103 104 <span class="sr-only">(current)</span> 105 106 </a> 107 </li> 108 109 110 111 112 113 <li class="nav-item "> 114 <a class="nav-link" href="/projects/"> 115 research 116 117 </a> 118 </li> 119 120 121 122 123 124 125 126 <li class="nav-item "> 127 <a class="nav-link" href="/currvita/"> 128 currvita 129 130 </a> 131 </li> 132 133 134 135 136 <!-- Blog --> 137 <!-- 138 <li class="nav-item "> 139 <a class="nav-link" href="/blog/"> 140 blog 141 142 </a> 143 </li> 144 --> 145 </ul> 146 </div> 147 </div> 148 </nav> 149 150</header> 151 152 153 <!-- Content --> 154 155 <div class="container mt-5"> 156 <div class="post"> 157 158 <header class="post-header"> 159 <h1 class="post-title">publications</h1> 160 <p class="post-description"><p> List of latest publications by categories in reversed chronological order. A more complete list can be found in my <a href="https://dblp.org/pers/c/Cassano:Valentin.html">DBLP</a> section. </p> 161</p> 162 </header> 163 164 <article> 165 <div class="publications"> 166 167 168 <h2 class="year">2023</h2> 169 <ol class="bibliography"><li><div class="row"> 170 <div class="col-sm-2 abbr"> 171 172 173 <abbr class="badge">AAMAS 2023</abbr> 174 175 176 </div> 177 178 <div id="aamas/ArecesCCFS23" class="col-sm-8"> 179
180 <span class="title">A Deontic Logic of Knowingly Complying</span> 181 <span class="author"> 182 183 184 185 186 187 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 188 189 190 191 192 193 194 195 196 <em>Cassano, V.</em>, 197 198 199 200 201 202 203 204 205 <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a>, 206 207 208 209 210 211 212 213 214 215 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 216 217 218 219 220 221 222 223 224 225 and <a href="https://andresrsaravia.github.io/" target="_blank">Saravia, A.</a> 226 227 228 229 230 231 </span> 232 233 <span class="periodical"> 234 235 236 237 238 <em>In Proceedings of the 2023 International Conference on Autonomous Agents 239 and Multiagent Systems.</em> 240 241 <em> 242 Eds.: 243 244 245 246 247 248 Agmon, N., 249 250 251 252 253 254 255 256 257 258 An, B., 259 260 261 262 263 264 265 266 267 268 Ricci, A., 269 270 271 272 273 274 275 276 277 278 and Yeoh, W. 279 280 281 282 283 284 </em> 285 286 287 288 289 <em>pp. 364â372.</em> 290 291 292 <em>ACM.</em> 293 294 295 <!-- 296 2023 297 --> 298 </span> 299 300 301 <span class="links"> 302 303 [<a class="abstract">Abstract</a>] 304 305 306 307 308 [<a href="/assets/pdf/aamas2023.pdf" target="_blank">PDF</a>] 309 310 311 312 313 314 </span> 315 316 <!-- Hidden abstract block --> 317 318 <span class="abstract hidden"> 319 <p>We introduce a logic for representing the deontic notion of knowingly complying associated to an agentâs conciousness of taking a normative course of action for achieving a certain goal. Our logic features an operator for describing normative courses of actions, and another operator for describing what each agent knowingly complies with. We provide a sound and complete axiom system for our logic, and study the computational complexity of its satisfiability problem. Finally, we extend our logic with an additional operator for capturing the general abilities of the agents. This operator enables us to distinguish âwhat agents can doâ and âwhat agents do according to normsâ. For this extension, we also provide a sound and complete axiom system.</p> 320 </span> 321 322 </div> 323</div> 324</li></ol> 325 326 <h2 class="year">2022</h2> 327 <ol class="bibliography"><li><div class="row"> 328 <div class="col-sm-2 abbr"> 329 330 331 <abbr class="badge">JLC 2022</abbr> 332 333 334 </div> 335 336 <div id="logcom/CassanoFAC22" class="col-sm-8"> 337 338 <span class="title">Algebraic tools for default modal systems</span> 339 <span class="author"> 340 341 342 343 344 <em>Cassano, V.</em>, 345 346 347 348 349 350 351 352 353 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 354 355 356 357 358 359 360 361 362 363 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 364 365 366 367 368 369 370 371 372 373 and <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a> 374 375 376 377 378 379 </span> 380
381 <span class="periodical"> 382 383 384 <em>Journal of Logic and Computation</em> 385 386 387 388 <!-- 389 2022 390 --> 391 </span> 392 393 394 <span class="links"> 395 396 [<a class="abstract">Abstract</a>] 397 398 399 400 401 [<a href="/assets/pdf/jlc2022.pdf" target="_blank">PDF</a>] 402 403 404 405 406 407 </span> 408 409 <!-- Hidden abstract block --> 410 411 <span class="abstract hidden"> 412 <p>Default Logics are a family of non-monotonic formalisms having so-called defaults and extensions as their common foundation. Traditionally, default logics have been defined and dealt with via syntactic notions of consequence in propositional or first-order logic. Here, we build default logics on modal logics. First, we present these default logics syntactically. Then, we elaborate on an algebraic counterpart. More precisely, we extend the notion of a modal algebra to accommodate for defaults and extensions. Our algebraic view of default logics concludes with an algebraic completeness result and a way of comparing default logics borrowing ideas from the concept of bisimulation in modal logic. To our knowledge, this take on default logics approach is novel. Interestingly, it also lays the groundwork for studying default logics from a dynamic logic perspective.</p> 413 </span> 414 415 </div> 416</div> 417</li> 418<li><div class="row"> 419 <div class="col-sm-2 abbr"> 420 421 422 <abbr class="badge">WoLLIC 2022</abbr> 423 424 425 </div> 426 427 <div id="wollic/ArecesCF22" class="col-sm-8"> 428 429 <span class="title">Nonmonotonic Reasoning via Dynamic Consequence</span> 430 <span class="author"> 431 432 433 434 435 436 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 437 438 439 440 441 442 443 444 445 <em>Cassano, V.</em>, 446 447 448 449 450 451 452 453 454 and <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a> 455 456 457 458 459 460 </span> 461 462 <span class="periodical"> 463 464 465 466 467 <em>In 28th Workshop on Logic, Language, Information, and Computation.</em> 468 469 <em> 470 Eds.: 471 472 473 474 475 476 Ciabattoni, A., 477 478 479 480 481 482 483 484 485 486 Pimentel, E., 487 488 489 490 491 492 493 494 495 496 and Queiroz, R. 497 498 499 500 501 502 </em> 503 504 505 <em>Vol.: 13468.</em> 506 507 508 <em>LNCS.</em> 509 510 511 <em>pp. 395â410.</em> 512 513 514 <em>Springer.</em> 515 516 517 <!-- 518 2022 519 --> 520 </span> 521 522 523 <span class="links"> 524 525 [<a class="abstract">Abstract</a>] 526 527 528 529 530 [<a href="/assets/pdf/wollic2020.pdf" target="_blank">PDF</a>] 531 532 533 534 535 536 </span> 537 538 <!-- Hidden abstract block --> 539 540 <span class="abstract hidden"> 541 <p>We approach the concept of Pivotal Rule Consequence (ð¯ð±ð¢) from a semantical perspective, resorting to model updates in Public Announcement Logic (ð¯ð ð«). In doing this, we take inspiration from the notion of dynamic consequence. Our perspective gains in interest since ð¯ð±ð¢ serves as a âbridgeâ from Classical Logic to Default Logic âone of the most well-known non-monotonic formalisms. We show how the internalization of ð¯ð±ð¢ in ð¯ð ð« leads to clear semantics of the former, and to completeness and transfer results. Moreover, we address the case of credulous consequence in Default Logic as a particular case of ð¯ð±ð¢. Interestingly, we cast credulous consequence as a model checking problem. We argue that our results open the way to use well-known semantic tools from modal logic to study properties of different non-monotonic logics.</p> 542 </span> 543 544 </div> 545</div> 546</li></ol> 547 548 <h2 class="year">2021</h2> 549 <ol class="bibliography"><li><div class="row"> 550 <div class="col-sm-2 abbr"> 551 552 553 <abbr class="badge">DEON 2020/21</abbr> 554 555 556 </div> 557 558 <div id="deon/CastroCFA20" class="col-sm-8"> 559
560 <span class="title">Deontic Action Logics via Algebra</span> 561 <span class="author"> 562 563 564 565 566 567 <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a>, 568 569 570 571 572 573 574 575 576 <em>Cassano, V.</em>, 577 578 579 580 581 582 583 584 585 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 586 587 588 589 590 591 592 593 594 595 and <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a> 596 597 598 599 600 601 </span> 602 603 <span class="periodical"> 604 605 606 607 608 <em>In 15th International Conference on Deontic Logic and Normative Systems.</em> 609 610 <em> 611 Eds.: 612 613 614 615 616 617 Liu, F., 618 619 620 621 622 623 624 625 626 627 Marra, A., 628 629 630 631 632 633 634 635 636 637 Portner, P., 638 639 640 641 642 643 644 645 646 647 and Van De Putte, F. 648 649 650 651 652 653 </em> 654 655 656 657 658 <em>pp. 17.</em> 659 660 661 <em>College Publications.</em> 662 663 664 <!-- 665 2021 666 --> 667 </span> 668 669 670 <span class="links"> 671 672 [<a class="abstract">Abstract</a>] 673 674 675 676 [<a href="https://collegepublications.co.uk/DEON/Castro&%20Cassano%20&%20Fervari%20&%20Areces_DEON2020.pdf" target="_blank">URL</a>] 677 678 679 [<a href="/assets/pdf/deon2020.pdf" target="_blank">PDF</a>] 680 681 682 683 684 685 </span> 686 687 <!-- Hidden abstract block --> 688 689 <span class="abstract hidden"> 690 <p>Deontic logics are dubbed the logics of normative or prescriptive reasoning. These logics can roughly be categorized into ought-to-be, dealing with the prescription of state of affairs, or ought-to-do, dealing with the prescription of actions. An important family of ought-to-do deontic logics have their origin in Segerbergâs Deontic Action Logic (DAL). In this work, we provide an algebraic characterization of DAL and some known variants. In brief, we capture actions and formulas as elements of different base algebras, and deontic operators as algebraic operations; different algebras capture the different variants. This algebraization enables us to obtain completeness results via standard algebraic means. Moreover, we argue that this algebraic framework offers a natural way of (re-)thinking many deontic logical issues at large.</p> 691 </span> 692 693 </div> 694</div> 695</li></ol> 696 697 <h2 class="year">2020</h2> 698 <ol class="bibliography"><li><div class="row"> 699 <div class="col-sm-2 abbr"> 700 701 702 <abbr class="badge">DaLi 2020</abbr> 703 704 705 </div> 706 707 <div id="dali/CassanoFAC20" class="col-sm-8"> 708 709 <span class="title">Default Modal Systems as Algebraic Updates</span> 710 <span class="author"> 711 712 713 714 715 <em>Cassano, V.</em>, 716 717 718 719 720 721 722 723 724 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 725 726 727 728 729 730 731 732 733 734 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 735 736 737 738 739 740 741 742 743 744 and <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a> 745 746 747 748 749 750 </span> 751
752 <span class="periodical"> 753 754 755 756 757 <em>In 3rd Workshop on Dynamic Logic: New Trends and Applications.</em> 758 759 <em> 760 Eds.: 761 762 763 764 765 766 Martins, M., 767 768 769 770 771 772 773 774 775 776 and Sedlar, I. 777 778 779 780 781 782 </em> 783 784 785 <em>Vol.: 12569.</em> 786 787 788 <em>LNCS.</em> 789 790 791 <em>pp. 103â119.</em> 792 793 794 <em>Springer.</em> 795 796 797 <!-- 798 2020 799 --> 800 </span> 801 802 803 <span class="links"> 804 805 [<a class="abstract">Abstract</a>] 806 807 808 809 [<a href="http://www.cs.cas.cz/dali2020/" target="_blank">URL</a>] 810 811 812 [<a href="/assets/pdf/dali2020.pdf" target="_blank">PDF</a>] 813 814 815 816 817 818 </span> 819 820 <!-- Hidden abstract block --> 821 822 <span class="abstract hidden"> 823 <p>Default Logic refers to a family of formalisms designed to carry out non-monotonic reasoning over a monotonic logic (in general, Classical First-Order or Propositional Logic). Traditionally, default logics have been defined and dealt with via syntactic consequence relations. Here, we introduce a family of default logics defined over modal logics. First, we present these default logics syntactically. Then, we elaborate on an algebraic counterpart. We do the latter by extending the notion of a modal algebra to acommodate for the main elements of default logics: defaults and extensions. Our algebraic treatment of default logics concludes with an algebraic completeness result. To our knowledge, our approach is novel, and it lays the groundwork for studying default logics from a dynamic logic perspective.</p> 824 </span> 825 826 </div> 827</div> 828</li></ol> 829 830 <h2 class="year">2019</h2> 831 <ol class="bibliography"><li><div class="row"> 832 <div class="col-sm-2 abbr"> 833 834 835 <abbr class="badge">CADE 2019</abbr> 836 837 838 </div> 839 840 <div id="cade/CassanoFHAC19" class="col-sm-8"> 841 842 <span class="title">A Tableaux Calculus for Default Intuitionistic Logic</span> 843 <span class="author"> 844 845 846 847 848 <em>Cassano, V.</em>, 849 850 851 852 853 854 855 856 857 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 858 859 860 861 862 863 864 865 866 867 Hoffmann, G., 868 869 870 871 872 873 874 875 876 877 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 878 879 880 881 882 883 884 885 886 887 and <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a> 888 889 890 891 892 893 </span> 894 895 <span class="periodical"> 896 897 898 899 900 <em>In 27th International Conference on Automated Deduction.</em> 901 902 <em> 903 Eds.: 904 905 906 907 Fontaine, P. 908 909 910 911 </em> 912 913 914 <em>Vol.: 11716.</em> 915 916 917 <em>LNCS.</em> 918 919 920 <em>pp. 161â177.</em> 921 922 923 <em>Springer.</em> 924 925 926 <!-- 927 2019 928 --> 929 </span> 930 931 932 <span class="links"> 933 934 [<a class="abstract">Abstract</a>] 935 936 937 938 [<a href="https://doi.org/10.1007/978-3-030-29436-6_10" target="_blank">URL</a>] 939 940 941 [<a href="/assets/pdf/cade2019.pdf" target="_blank">PDF</a>] 942 943 944 945 946 947 </span> 948 949 <!-- Hidden abstract block --> 950 951 <span class="abstract hidden"> 952 <p>We build a Default Logic variant on Intuitionistic Propositional Logic and develop a sound, complete, and terminating, tableaux calculus for it. We also present an implementation of the calculus. We motivate and illustrate the technical elements of our work with examples.</p> 953 </span> 954 955 </div> 956</div> 957</li> 958<li><div class="row"> 959 <div class="col-sm-2 abbr"> 960 961 962 <abbr class="badge">JELIA 2019</abbr> 963 964 965 </div> 966 967 <div id="jelia/CassanoFAC19" class="col-sm-8"> 968
969 <span class="title">Interpolation and Beth Definability in Default Logics</span> 970 <span class="author"> 971 972 973 974 975 <em>Cassano, V.</em>, 976 977 978 979 980 981 982 983 984 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 985 986 987 988 989 990 991 992 993 994 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 995 996 997 998 999 1000 1001 1002 1003 1004 and <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a> 1005 1006 1007 1008 1009 1010 </span> 1011 1012 <span class="periodical"> 1013 1014 1015 1016 1017 <em>In 16th European Conference on Logics in Artificial Intelligence.</em> 1018 1019 <em> 1020 Eds.: 1021 1022 1023 1024 1025 1026 Calimeri, F., 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 Leone, N., 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 and Manna, M. 1047 1048 1049 1050 1051 1052 </em> 1053 1054 1055 <em>Vol.: 11468.</em> 1056 1057 1058 <em>LNCS.</em> 1059 1060 1061 <em>pp. 675â691.</em> 1062 1063 1064 <em>Springer.</em> 1065 1066 1067 <!-- 1068 2019 1069 --> 1070 </span> 1071 1072 1073 <span class="links"> 1074 1075 [<a class="abstract">Abstract</a>] 1076 1077 1078 1079 [<a href="https://doi.org/10.1007/978-3-030-19570-0_44" target="_blank">URL</a>] 1080 1081 1082 [<a href="/assets/pdf/jelia2019.pdf" target="_blank">PDF</a>] 1083 1084 1085 1086 1087 1088 </span> 1089 1090 <!-- Hidden abstract block --> 1091 1092 <span class="abstract hidden"> 1093 <p>We investigate interpolation and Beth definability in default logics. To this end, we start by defining a general framework which is sufficiently abstract to encompass most of the usual definitions of a default Logic. In this framework a default logic DL is built on a base, monotonic, logic L. We then investigate the question of when interpolation and Beth definability results transfer from L to DL. This investigation needs suitable notions of interpolation and Beth definability for default logics. We show both positive and negative general results: depending on how DL is defined and of the kind of interpolation/Beth definability involved, the property might or might not transfer from L to DL.</p> 1094 </span> 1095 1096 </div> 1097</div> 1098</li> 1099<li><div class="row"> 1100 <div class="col-sm-2 abbr"> 1101 1102 1103 <abbr class="badge">TARK 2019</abbr> 1104 1105 1106 </div> 1107 1108 <div id="tark/CastroCFA19" class="col-sm-8"> 1109 1110 <span class="title">An Algebraic Approach for Action Based Default Reasoning</span> 1111 <span class="author"> 1112 1113 1114 1115 1116 1117 <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a>, 1118 1119 1120 1121 1122 1123 1124 1125 1126 <em>Cassano, V.</em>, 1127 1128 1129 1130 1131 1132 1133 1134 1135 <a href="https://rfervari.github.io/" target="_blank">Fervari, R.</a>, 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 and <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a> 1146 1147 1148 1149 1150 1151 </span> 1152
1153 <span class="periodical"> 1154 1155 1156 1157 1158 <em>In 17th Conference on Theoretical Aspects of Rationality and Knowledge.</em> 1159 1160 <em> 1161 Eds.: 1162 1163 1164 1165 Moss, L. 1166 1167 1168 1169 </em> 1170 1171 1172 <em>Vol.: 297.</em> 1173 1174 1175 <em>EPTCS.</em> 1176 1177 1178 <em>pp. 91â105.</em> 1179 1180 1181 <em>Open Publishing Association.</em> 1182 1183 1184 <!-- 1185 2019 1186 --> 1187 </span> 1188 1189 1190 <span class="links"> 1191 1192 [<a class="abstract">Abstract</a>] 1193 1194 1195 1196 [<a href="https://doi.org/10.4204/EPTCS.297.7" target="_blank">URL</a>] 1197 1198 1199 [<a href="/assets/pdf/tark2019.pdf" target="_blank">PDF</a>] 1200 1201 1202 1203 1204 1205 </span> 1206 1207 <!-- Hidden abstract block --> 1208 1209 <span class="abstract hidden"> 1210 <p>Often, we assume that an action is permitted simply because it is not explicitly forbidden; or, similarly, that an action is forbidden simply because it is not explicitly permitted. This kind of assumptions appear, e.g., in autonomous computing systems where decisions must be taken in the presence of an incomplete set of norms regulating a particular scenario. 1211 Combining default and deontic reasoning over actions allows us to formally reason about such assumptions. With this in mind, we propose a logical formalism for default reasoning over a deontic action logic. The novelty of our approach is twofold. First, our formalism for default reasoning deals with actions and action operators, and it is based on a deontic action logic originally proposed by Segerberg. Second, inspired by Segerbergâs approach, we use tools coming from the theory of Boolean Algebra. These tools allow us to extend Segerbergâs algebraic completeness result to the setting of Default Logics.</p> 1212 </span> 1213 1214 </div> 1215</div> 1216</li></ol> 1217 1218 <h2 class="year">2018</h2> 1219 <ol class="bibliography"><li><div class="row"> 1220 <div class="col-sm-2 abbr"> 1221 1222 1223 <abbr class="badge">LPAR-22</abbr> 1224 1225 1226 </div> 1227 1228 <div id="lpar/CassanoAC18" class="col-sm-8"> 1229 1230 <span class="title">Reasoning About Prescription and Description Using Prioritized Default Rules</span> 1231 <span class="author"> 1232 1233 1234 1235 1236 <em>Cassano, V.</em>, 1237 1238 1239 1240 1241 1242 1243 1244 1245 <a href="https://carlosareces.github.io/" target="_blank">Areces, C.</a>, 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 and <a href="https://pablofcastro.github.io/" target="_blank">Castro, P.</a> 1256 1257 1258 1259 1260 1261 </span> 1262 1263 <span class="periodical"> 1264 1265 1266 1267 1268 <em>In 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning.</em> 1269 1270 <em> 1271 Eds.: 1272 1273 1274 1275 1276 1277 Barthe, G., 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 Sutcliffe, G., 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 and Veanes, M. 1298 1299 1300 1301 1302 1303 </em> 1304 1305 1306 <em>Vol.: 57.</em> 1307 1308 1309 <em>EPiC Series in Computing.</em> 1310 1311 1312 <em>pp. 196â213.</em> 1313 1314 1315 <em>EasyChair.</em> 1316 1317 1318 <!-- 1319 2018 1320 --> 1321 </span> 1322 1323 1324 <span class="links"> 1325 1326 [<a class="abstract">Abstract</a>] 1327 1328 1329 1330 [<a href="https://easychair.org/publications/paper/Zn7P" target="_blank">URL</a>] 1331 1332 1333 [<a href="/assets/pdf/lpar2018.pdf" target="_blank">PDF</a>] 1334 1335 1336 1337 1338 1339 </span> 1340 1341 <!-- Hidden abstract block --> 1342 1343 <span class="abstract hidden"> 1344 <p>In this paper we introduce a prioritized default logic. We build this logic modularly from Standard Deontic Logic by the addition of default rules and priorities among them. Our main aim is to provide a logical framework to reason about scenarios where prescriptive and descriptive statements coexist and may be incomplete and contradictory. We motivate and illustrate the technical elements of our work with the use of examples (classical, and coming from softw
1344are engineering). In addition, we present sound, complete, and terminating (with loop check) tableau-based proof calculi for credulous and sceptical reasoning in our logic.</p> 1345 </span> 1346 1347 </div> 1348</div> 1349</li></ol> 1350 1351 1352</div> 1353 1354 </article> 1355 1356</div> 1357 1358 </div> 1359 1360 <!-- Footer --> 1361 1362 1363<footer class="fixed-bottom"> 1364 <div class="container mt-0" style="text-align:center;"> 1365 © Copyright 2023 Valentin Cassano. 1366 Powered by <a href="http://jekyllrb.com/" target="_blank">Jekyll</a> with <a href="https://github.com/alshedivat/al-folio">al-folio</a> theme. Hosted by <a href="https://pages.github.com/" target="_blank">GitHub Pages</a>. 1367 1368 1369 Last updated: June 08, 2023. 1370 1371 </div> 1372</footer> 1373 1374 1375 1376 </body> 1377 1378 <!-- Load Core and Bootstrap JS -->
1379<script src="https://code.jquery.com/jquery-3.4.1.slim.min.js" integrity="sha384-J6qa4849blE2+poT4WnyKhv5vZF5SrPo0iEjwBvKU7imGFAV0wwj1yYfoRSJoZ+n" crossorigin="anonymous"></script>
vendor: 1 bytes, line 1379
1379
1380<script src="https://cdnjs.cloudflare.com/ajax/libs/popper.js/2.4.0/umd/popper.min.js" integrity="sha256-OH05DFHUWzr725HmuHo3pnuvUUn+TJuj8/Qz9xytFEw=" crossorigin="anonymous"></script>
vendor: 1 bytes, line 1380
1380
1381<script src="https://stackpath.bootstrapcdn.com/bootstrap/4.4.1/js/bootstrap.min.js" integrity="sha384-wfSDF2E50Y2D1uUdj0O3uMBJnjuUD4Ih7YwaYd1iqfktj0Uod8GCExl3Og8ifwB6" crossorigin="anonymous"></script>
vendor: 1 bytes, line 1381
1381
1382<script src="https://cdnjs.cloudflare.com/ajax/libs/mdbootstrap/4.17.0/js/mdb.min.js" integrity="sha384-wfSDF2E50Y2D1uUdj0O3uMBJnjuUD4Ih7YwaYd1iqfktj0Uod8GCExl3Og8ifwB6" crossorigin="anonymous"></script>
1382 1383 1384<!-- Load Common JS -->
1385<script src="/assets/js/common.js"></script>
1385 1386 1387<!-- Code Syntax Highlighting --> 1388<link rel="stylesheet" href="https://gitcdn.link/repo/jwarby/jekyll-pygments-themes/master/github.css" /> 1389 1390 1391<!-- Load KaTeX --> 1392<link rel="stylesheet" href="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.11.1/katex.min.css" integrity="sha256-V8SV2MO1FUb63Bwht5Wx9x6PVHNa02gv8BgH/uH3ung=" crossorigin="anonymous" />
1393<script src="https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.11.1/katex.min.js" integrity="sha256-F/Xda58SPdcUCr+xhSGz9MA2zQBPb0ASEYKohl8UCHc=" crossorigin="anonymous"></script>
vendor: 1 bytes, line 1393
1393
1394<script src="/assets/js/katex.js"></script>
1394 1395 1396 1397 1398<!-- Load Mansory & imagesLoaded -->
1399<script src="https://cdnjs.cloudflare.com/ajax/libs/masonry/4.2.2/masonry.pkgd.min.js" integrity="" crossorigin="anonymous"></script>
vendor: 1 bytes, line 1399
1399
1400<script src="https://unpkg.com/imagesloaded@4/imagesloaded.pkgd.min.js"></script>
1400 1401 1402<!-- Project Cards Layout -->
1403<script type="text/javascript"> 1404 // Init Masonry 1405 var $grid = $('.grid').masonry({ 1406 gutter: 10, 1407 horizontalOrder: true, 1408 itemSelector: '.grid-item', 1409 }); 1410 // layout Masonry after each image loads 1411 $grid.imagesLoaded().progress( function() { 1412 $grid.masonry('layout'); 1413 }); 1414</script>
1414 1415 1416 1417 1418 1419 1420 1421 1422</html>
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.