CINXE.COM

<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Logic Programming Research Papers - Academia.edu</title>  <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="aBNAaEH09d3RFuCvoQJAlwVIw3H/o9IRuw1bu+ExffDI8InWmy0G8JxlCHQ8v+JLSyj7wcrleKZC25QGE+4T1A==" /> <link href="/Documents/in/Logic_Programming?after=50%2C5396567" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-10fa40af19d25203774df2d4a03b9b5771b45109c2304968038e88a81d1215c5.css" /> <meta name="description" content="View Logic Programming Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = '05808568ced7ee070549b97c59e075033ee39c1f'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":15272,"monthly_visitors":"114 million","monthly_visitor_count":114182280,"monthly_visitor_count_in_millions":114,"user_count":277420194,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1732682729000); window.Aedu.timeDifference = new Date().getTime() - 1732682729000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script>  <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" rel="stylesheet"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-296162c7af6fd81dcdd76f1a94f1fad04fb5f647401337d136fe8b68742170b1.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-a2208e7a89ff8cb4e7176971621233ad2a3208490a8f2da1531358e84da02f9e.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-e43bce35633468c1813d4343f75921e711e23184c155b369dbb9a78476c17c88.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script>  <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script>  <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Logic_Programming" /> </head>   <body class='c-by_tag a-show_one logged_out u-bgColorWhite'>  <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more&nbsp<span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://medium.com/@academia">Blog</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less&nbsp<span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Logic Programming</h1><div class="u-tcGrayDark">6,234 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Logic Programming</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Logic_Programming">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Logic_Programming/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Logic_Programming/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Logic_Programming/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Logic_Programming">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_68050936" data-work_id="68050936" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/68050936/Combinations_of_abstract_domains_for_logic_programming_Open_product_and_generic_pattern_construction">Combinations of abstract domains for logic programming: Open product and generic pattern construction</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/68050936" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a6e68df1d097cabf7f16012a31b70340" rel="nofollow" data-download="{"attachment_id":78668307,"asset_id":68050936,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78668307/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="199953347" href="https://unive.academia.edu/ACortesi">Agostino Cortesi</a><script data-card-contents-for-user="199953347" type="text/json">{"id":199953347,"first_name":"Agostino","last_name":"Cortesi","domain_name":"unive","page_name":"ACortesi","display_name":"Agostino Cortesi","profile_url":"https://unive.academia.edu/ACortesi?f_ri=2529","photo":"https://0.academia-photos.com/199953347/61557464/49836224/s65_agostino.cortesi.jpeg"}</script></span></span></li><li class="js-paper-rank-work_68050936 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="68050936"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 68050936, container: ".js-paper-rank-work_68050936", }); });</script></li><li class="js-percentile-work_68050936 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 68050936; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_68050936"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_68050936 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="68050936"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 68050936; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=68050936]").text(description); $(".js-view-count-work_68050936").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_68050936").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="68050936"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2202" href="https://www.academia.edu/Documents/in/Abstract_Interpretation">Abstract Interpretation</a>, <script data-card-contents-for-ri="2202" type="text/json">{"id":2202,"name":"Abstract Interpretation","url":"https://www.academia.edu/Documents/in/Abstract_Interpretation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="64561" href="https://www.academia.edu/Documents/in/Computer_Software">Computer Software</a><script data-card-contents-for-ri="64561" type="text/json">{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=68050936]'), work: {"id":68050936,"title":"Combinations of abstract domains for logic programming: Open product and generic pattern construction","created_at":"2022-01-13T23:37:22.251-08:00","url":"https://www.academia.edu/68050936/Combinations_of_abstract_domains_for_logic_programming_Open_product_and_generic_pattern_construction?f_ri=2529","dom_id":"work_68050936","summary":null,"downloadable_attachments":[{"id":78668307,"asset_id":68050936,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":199953347,"first_name":"Agostino","last_name":"Cortesi","domain_name":"unive","page_name":"ACortesi","display_name":"Agostino Cortesi","profile_url":"https://unive.academia.edu/ACortesi?f_ri=2529","photo":"https://0.academia-photos.com/199953347/61557464/49836224/s65_agostino.cortesi.jpeg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":2202,"name":"Abstract Interpretation","url":"https://www.academia.edu/Documents/in/Abstract_Interpretation?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=2529","nofollow":false},{"id":85310,"name":"Science Computer","url":"https://www.academia.edu/Documents/in/Science_Computer?f_ri=2529"},{"id":267337,"name":"Environmental Science and Computer Programming","url":"https://www.academia.edu/Documents/in/Environmental_Science_and_Computer_Programming?f_ri=2529"},{"id":1543338,"name":"Static program analysis","url":"https://www.academia.edu/Documents/in/Static_program_analysis?f_ri=2529"},{"id":3383859,"name":"Direct Product","url":"https://www.academia.edu/Documents/in/Direct_Product?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_67896410 coauthored" data-work_id="67896410" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/67896410/Java_code_reviewer_for_verifying_object_oriented_design_in_class_diagrams">Java code reviewer for verifying object-oriented design in class diagrams</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Verification and Validation (V&amp;V) processes play an important role in quality control. The earlier defects are detected, the less rework incurs. According to the findings from literature, most of the defects occurred during the design... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_67896410" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Verification and Validation (V&amp;V) processes play an important role in quality control. The earlier defects are detected, the less rework incurs. According to the findings from literature, most of the defects occurred during the design and coding phases. Automatic detection of these defects would alleviate the problem. This research therefore invented an automatic code reviewer to examine Java source files against the object-oriented design described in UML class diagrams. Prior to the review process, the class diagrams are converted into XML format so that the information of classes and relations could be extracted and used to generate the review checklists. The code reviewer will then follow the checklist items to verify whether all defined classes exist in the code, the class structures with encapsulated methods and parameters are correctly implemented, all relations of associated classes are valid. Finally, the summary report will then be generated to notify the results.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/67896410" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="212247248" href="https://independent.academia.edu/YachaiLimpiyakorn">Yachai Limpiyakorn</a><script data-card-contents-for-user="212247248" type="text/json">{"id":212247248,"first_name":"Yachai","last_name":"Limpiyakorn","domain_name":"independent","page_name":"YachaiLimpiyakorn","display_name":"Yachai Limpiyakorn","profile_url":"https://independent.academia.edu/YachaiLimpiyakorn?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-67896410">+1</span><div class="hidden js-additional-users-67896410"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/KanitJinto">Kanit Jinto</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-67896410'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-67896410').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_67896410 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="67896410"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 67896410, container: ".js-paper-rank-work_67896410", }); });</script></li><li class="js-percentile-work_67896410 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 67896410; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_67896410"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_67896410 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="67896410"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 67896410; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=67896410]").text(description); $(".js-view-count-work_67896410").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_67896410").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="67896410"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">16</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="453" href="https://www.academia.edu/Documents/in/Object_Oriented_Programming">Object Oriented Programming</a>, <script data-card-contents-for-ri="453" type="text/json">{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2009" href="https://www.academia.edu/Documents/in/Data_Mining">Data Mining</a>, <script data-card-contents-for-ri="2009" type="text/json">{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5279" href="https://www.academia.edu/Documents/in/XML">XML</a><script data-card-contents-for-ri="5279" type="text/json">{"id":5279,"name":"XML","url":"https://www.academia.edu/Documents/in/XML?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=67896410]'), work: {"id":67896410,"title":"Java code reviewer for verifying object-oriented design in class diagrams","created_at":"2022-01-12T21:26:46.562-08:00","url":"https://www.academia.edu/67896410/Java_code_reviewer_for_verifying_object_oriented_design_in_class_diagrams?f_ri=2529","dom_id":"work_67896410","summary":"Verification and Validation (V\u0026amp;V) processes play an important role in quality control. The earlier defects are detected, the less rework incurs. According to the findings from literature, most of the defects occurred during the design and coding phases. Automatic detection of these defects would alleviate the problem. This research therefore invented an automatic code reviewer to examine Java source files against the object-oriented design described in UML class diagrams. Prior to the review process, the class diagrams are converted into XML format so that the information of classes and relations could be extracted and used to generate the review checklists. The code reviewer will then follow the checklist items to verify whether all defined classes exist in the code, the class structures with encapsulated methods and parameters are correctly implemented, all relations of associated classes are valid. Finally, the summary report will then be generated to notify the results.","downloadable_attachments":[],"ordered_authors":[{"id":212247248,"first_name":"Yachai","last_name":"Limpiyakorn","domain_name":"independent","page_name":"YachaiLimpiyakorn","display_name":"Yachai Limpiyakorn","profile_url":"https://independent.academia.edu/YachaiLimpiyakorn?f_ri=2529","photo":"/images/s65_no_pic.png"},{"id":213399680,"first_name":"Kanit","last_name":"Jinto","domain_name":"independent","page_name":"KanitJinto","display_name":"Kanit Jinto","profile_url":"https://independent.academia.edu/KanitJinto?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=2529","nofollow":false},{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":5279,"name":"XML","url":"https://www.academia.edu/Documents/in/XML?f_ri=2529","nofollow":false},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=2529"},{"id":37306,"name":"Quality Control","url":"https://www.academia.edu/Documents/in/Quality_Control?f_ri=2529"},{"id":50201,"name":"Object Oriented Design","url":"https://www.academia.edu/Documents/in/Object_Oriented_Design?f_ri=2529"},{"id":57987,"name":"Software Quality","url":"https://www.academia.edu/Documents/in/Software_Quality?f_ri=2529"},{"id":117397,"name":"Verification","url":"https://www.academia.edu/Documents/in/Verification?f_ri=2529"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=2529"},{"id":195515,"name":"Code Review","url":"https://www.academia.edu/Documents/in/Code_Review?f_ri=2529"},{"id":208862,"name":"UML Class Diagram","url":"https://www.academia.edu/Documents/in/UML_Class_Diagram?f_ri=2529"},{"id":316270,"name":"Class Diagram","url":"https://www.academia.edu/Documents/in/Class_Diagram?f_ri=2529"},{"id":499589,"name":"Unified Modeling Language","url":"https://www.academia.edu/Documents/in/Unified_Modeling_Language?f_ri=2529"},{"id":564649,"name":"Inspection","url":"https://www.academia.edu/Documents/in/Inspection?f_ri=2529"},{"id":2548020,"name":"Automatic Detection","url":"https://www.academia.edu/Documents/in/Automatic_Detection?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_18192400" data-work_id="18192400" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/18192400/The_Conflict_Driven_Answer_Set_Solver_clasp_Progress_Report">The Conflict-Driven Answer Set Solver clasp: Progress Report</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/18192400" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8facf89035b805fa07970ae595c6daa4" rel="nofollow" data-download="{"attachment_id":39925420,"asset_id":18192400,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39925420/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="38030528" href="https://independent.academia.edu/MartinGebser">Martin Gebser</a><script data-card-contents-for-user="38030528" type="text/json">{"id":38030528,"first_name":"Martin","last_name":"Gebser","domain_name":"independent","page_name":"MartinGebser","display_name":"Martin Gebser","profile_url":"https://independent.academia.edu/MartinGebser?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_18192400 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="18192400"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 18192400, container: ".js-paper-rank-work_18192400", }); });</script></li><li class="js-percentile-work_18192400 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 18192400; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_18192400"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_18192400 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="18192400"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 18192400; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=18192400]").text(description); $(".js-view-count-work_18192400").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_18192400").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="18192400"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=18192400]'), work: {"id":18192400,"title":"The Conflict-Driven Answer Set Solver clasp: Progress Report","created_at":"2015-11-12T02:48:30.498-08:00","url":"https://www.academia.edu/18192400/The_Conflict_Driven_Answer_Set_Solver_clasp_Progress_Report?f_ri=2529","dom_id":"work_18192400","summary":null,"downloadable_attachments":[{"id":39925420,"asset_id":18192400,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":38030528,"first_name":"Martin","last_name":"Gebser","domain_name":"independent","page_name":"MartinGebser","display_name":"Martin Gebser","profile_url":"https://independent.academia.edu/MartinGebser?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_67312317" data-work_id="67312317" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/67312317/Formal_Modelling_of_the_ADSP_2100_Processor_Using_HOL">Formal Modelling of the ADSP-2100 Processor Using HOL</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Hardware and software systems are growing everyday in scale and functionality. This increase in complexity increases the number of subtle errors. Moreover, some of these errors may cause catastrophic loss of money, time, or even in many... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_67312317" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Hardware and software systems are growing everyday in scale and functionality. This increase in complexity increases the number of subtle errors. Moreover, some of these errors may cause catastrophic loss of money, time, or even in many cases human life. A major goal of ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/67312317" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="72666aeabf0828e0f7c815289cd00787" rel="nofollow" data-download="{"attachment_id":78176327,"asset_id":67312317,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78176327/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="19156819" href="https://mincom.academia.edu/AdelGhazel">Adel Ghazel</a><script data-card-contents-for-user="19156819" type="text/json">{"id":19156819,"first_name":"Adel","last_name":"Ghazel","domain_name":"mincom","page_name":"AdelGhazel","display_name":"Adel Ghazel","profile_url":"https://mincom.academia.edu/AdelGhazel?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_67312317 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="67312317"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 67312317, container: ".js-paper-rank-work_67312317", }); });</script></li><li class="js-percentile-work_67312317 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 67312317; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_67312317"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_67312317 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="67312317"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 67312317; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=67312317]").text(description); $(".js-view-count-work_67312317").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_67312317").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="67312317"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">18</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="433" href="https://www.academia.edu/Documents/in/Computer_Architecture">Computer Architecture</a>, <script data-card-contents-for-ri="433" type="text/json">{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2141" href="https://www.academia.edu/Documents/in/Signal_Processing">Signal Processing</a>, <script data-card-contents-for-ri="2141" type="text/json">{"id":2141,"name":"Signal Processing","url":"https://www.academia.edu/Documents/in/Signal_Processing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=67312317]'), work: {"id":67312317,"title":"Formal Modelling of the ADSP-2100 Processor Using HOL","created_at":"2022-01-05T21:02:54.749-08:00","url":"https://www.academia.edu/67312317/Formal_Modelling_of_the_ADSP_2100_Processor_Using_HOL?f_ri=2529","dom_id":"work_67312317","summary":"Hardware and software systems are growing everyday in scale and functionality. This increase in complexity increases the number of subtle errors. Moreover, some of these errors may cause catastrophic loss of money, time, or even in many cases human life. A major goal of ...","downloadable_attachments":[{"id":78176327,"asset_id":67312317,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":19156819,"first_name":"Adel","last_name":"Ghazel","domain_name":"mincom","page_name":"AdelGhazel","display_name":"Adel Ghazel","profile_url":"https://mincom.academia.edu/AdelGhazel?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":433,"name":"Computer Architecture","url":"https://www.academia.edu/Documents/in/Computer_Architecture?f_ri=2529","nofollow":false},{"id":2141,"name":"Signal Processing","url":"https://www.academia.edu/Documents/in/Signal_Processing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":8367,"name":"Complexity","url":"https://www.academia.edu/Documents/in/Complexity?f_ri=2529"},{"id":9038,"name":"Digital Signal Processing","url":"https://www.academia.edu/Documents/in/Digital_Signal_Processing?f_ri=2529"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=2529"},{"id":19795,"name":"Theorem Proving","url":"https://www.academia.edu/Documents/in/Theorem_Proving?f_ri=2529"},{"id":48116,"name":"Digital Signal Processors","url":"https://www.academia.edu/Documents/in/Digital_Signal_Processors?f_ri=2529"},{"id":58056,"name":"Displays","url":"https://www.academia.edu/Documents/in/Displays?f_ri=2529"},{"id":59332,"name":"Processor Architecture","url":"https://www.academia.edu/Documents/in/Processor_Architecture?f_ri=2529"},{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=2529"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=2529"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=2529"},{"id":464357,"name":"Digital Signal Processor","url":"https://www.academia.edu/Documents/in/Digital_Signal_Processor?f_ri=2529"},{"id":567681,"name":"Software Systems","url":"https://www.academia.edu/Documents/in/Software_Systems?f_ri=2529"},{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529"},{"id":1302340,"name":"Electrical and Computer Engineering","url":"https://www.academia.edu/Documents/in/Electrical_and_Computer_Engineering?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19849280" data-work_id="19849280" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19849280/Logic_programming_with_infinite_sets">Logic programming with infinite sets</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19849280" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4b4602b7b4de6e96af6a59d42c938109" rel="nofollow" data-download="{"attachment_id":41276218,"asset_id":19849280,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41276218/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40638553" href="https://independent.academia.edu/VictorMarek">Victor Marek</a><script data-card-contents-for-user="40638553" type="text/json">{"id":40638553,"first_name":"Victor","last_name":"Marek","domain_name":"independent","page_name":"VictorMarek","display_name":"Victor Marek","profile_url":"https://independent.academia.edu/VictorMarek?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_19849280 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19849280"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19849280, container: ".js-paper-rank-work_19849280", }); });</script></li><li class="js-percentile-work_19849280 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19849280; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19849280"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19849280 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19849280"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19849280; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19849280]").text(description); $(".js-view-count-work_19849280").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19849280").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19849280"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22615" href="https://www.academia.edu/Documents/in/Knowledge_Representation">Knowledge Representation</a>, <script data-card-contents-for-ri="22615" type="text/json">{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="793230" href="https://www.academia.edu/Documents/in/Nonmonotonic_Logic">Nonmonotonic Logic</a><script data-card-contents-for-ri="793230" type="text/json">{"id":793230,"name":"Nonmonotonic Logic","url":"https://www.academia.edu/Documents/in/Nonmonotonic_Logic?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19849280]'), work: {"id":19849280,"title":"Logic programming with infinite sets","created_at":"2015-12-27T04:52:34.142-08:00","url":"https://www.academia.edu/19849280/Logic_programming_with_infinite_sets?f_ri=2529","dom_id":"work_19849280","summary":null,"downloadable_attachments":[{"id":41276218,"asset_id":19849280,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":40638553,"first_name":"Victor","last_name":"Marek","domain_name":"independent","page_name":"VictorMarek","display_name":"Victor Marek","profile_url":"https://independent.academia.edu/VictorMarek?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false},{"id":793230,"name":"Nonmonotonic Logic","url":"https://www.academia.edu/Documents/in/Nonmonotonic_Logic?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_60584666" data-work_id="60584666" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/60584666/Detecting_Deadlock_Double_Free_and_Other_Abuses_in_a_Million_Lines_of_Linux_Kernel_Source">Detecting Deadlock, Double-Free and Other Abuses in a Million Lines of Linux Kernel Source</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/60584666" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8daf0bfcc0c2192aaca6b9645688d762" rel="nofollow" data-download="{"attachment_id":73963520,"asset_id":60584666,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/73963520/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="178024" href="https://fau.academia.edu/MariaMLarrondoPetrie">Maria M. Larrondo Petrie</a><script data-card-contents-for-user="178024" type="text/json">{"id":178024,"first_name":"Maria M.","last_name":"Larrondo Petrie","domain_name":"fau","page_name":"MariaMLarrondoPetrie","display_name":"Maria M. Larrondo Petrie","profile_url":"https://fau.academia.edu/MariaMLarrondoPetrie?f_ri=2529","photo":"https://gravatar.com/avatar/9a3d9fea3dc8b184adeb8f3f3ffd303c?s=65"}</script></span></span></li><li class="js-paper-rank-work_60584666 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="60584666"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 60584666, container: ".js-paper-rank-work_60584666", }); });</script></li><li class="js-percentile-work_60584666 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 60584666; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_60584666"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_60584666 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="60584666"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 60584666; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=60584666]").text(description); $(".js-view-count-work_60584666").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_60584666").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="60584666"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">19</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2201" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a>, <script data-card-contents-for-ri="2201" type="text/json">{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2202" href="https://www.academia.edu/Documents/in/Abstract_Interpretation">Abstract Interpretation</a><script data-card-contents-for-ri="2202" type="text/json">{"id":2202,"name":"Abstract Interpretation","url":"https://www.academia.edu/Documents/in/Abstract_Interpretation?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=60584666]'), work: {"id":60584666,"title":"Detecting Deadlock, Double-Free and Other Abuses in a Million Lines of Linux Kernel Source","created_at":"2021-10-31T11:39:43.988-07:00","url":"https://www.academia.edu/60584666/Detecting_Deadlock_Double_Free_and_Other_Abuses_in_a_Million_Lines_of_Linux_Kernel_Source?f_ri=2529","dom_id":"work_60584666","summary":null,"downloadable_attachments":[{"id":73963520,"asset_id":60584666,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":178024,"first_name":"Maria M.","last_name":"Larrondo Petrie","domain_name":"fau","page_name":"MariaMLarrondoPetrie","display_name":"Maria M. Larrondo Petrie","profile_url":"https://fau.academia.edu/MariaMLarrondoPetrie?f_ri=2529","photo":"https://gravatar.com/avatar/9a3d9fea3dc8b184adeb8f3f3ffd303c?s=65"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false},{"id":2201,"name":"Static Analysis","url":"https://www.academia.edu/Documents/in/Static_Analysis?f_ri=2529","nofollow":false},{"id":2202,"name":"Abstract Interpretation","url":"https://www.academia.edu/Documents/in/Abstract_Interpretation?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":7376,"name":"Linux Kernel","url":"https://www.academia.edu/Documents/in/Linux_Kernel?f_ri=2529"},{"id":14182,"name":"Semantic Analysis","url":"https://www.academia.edu/Documents/in/Semantic_Analysis?f_ri=2529"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=2529"},{"id":28298,"name":"Formal Analysis","url":"https://www.academia.edu/Documents/in/Formal_Analysis?f_ri=2529"},{"id":28306,"name":"Open Source and Free Software Studies","url":"https://www.academia.edu/Documents/in/Open_Source_and_Free_Software_Studies?f_ri=2529"},{"id":31441,"name":"Software Verification and Validation","url":"https://www.academia.edu/Documents/in/Software_Verification_and_Validation?f_ri=2529"},{"id":44244,"name":"OPERATING SYSTEM","url":"https://www.academia.edu/Documents/in/OPERATING_SYSTEM?f_ri=2529"},{"id":45834,"name":"Open Source","url":"https://www.academia.edu/Documents/in/Open_Source?f_ri=2529"},{"id":89988,"name":"Assembly","url":"https://www.academia.edu/Documents/in/Assembly?f_ri=2529"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=2529"},{"id":131903,"name":"Arithmetic","url":"https://www.academia.edu/Documents/in/Arithmetic?f_ri=2529"},{"id":191487,"name":"Kernel","url":"https://www.academia.edu/Documents/in/Kernel?f_ri=2529"},{"id":366742,"name":"Eyes","url":"https://www.academia.edu/Documents/in/Eyes?f_ri=2529"},{"id":1149159,"name":"Deadlock Detection","url":"https://www.academia.edu/Documents/in/Deadlock_Detection?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_63769534" data-work_id="63769534" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/63769534/Teaching_artificial_intelligence_and_logic_programming_in_a_competitive_environment">Teaching artificial intelligence and logic programming in a competitive environment</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Abstract. Motivation plays a key role in the learning process. This paper describes an experience in the context of undergraduate teaching of Artificial Intelligence at the Computer Science Department of the Faculty of Sciences in the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_63769534" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Abstract. Motivation plays a key role in the learning process. This paper describes an experience in the context of undergraduate teaching of Artificial Intelligence at the Computer Science Department of the Faculty of Sciences in the University of Porto. A sophisticated competition framework, which involved Prolog programmed contenders and game servers, including an appealing GUI, was developed to motivate students on the deepening of the topics covered in class. We report on the impact that such a competitive setup caused on ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/63769534" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f8893bb5dc77231f352bb66dd970ad92" rel="nofollow" data-download="{"attachment_id":76083540,"asset_id":63769534,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/76083540/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="180421597" href="https://independent.academia.edu/PedroRibeiro407">Pedro Ribeiro</a><script data-card-contents-for-user="180421597" type="text/json">{"id":180421597,"first_name":"Pedro","last_name":"Ribeiro","domain_name":"independent","page_name":"PedroRibeiro407","display_name":"Pedro Ribeiro","profile_url":"https://independent.academia.edu/PedroRibeiro407?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_63769534 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="63769534"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 63769534, container: ".js-paper-rank-work_63769534", }); });</script></li><li class="js-percentile-work_63769534 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 63769534; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_63769534"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_63769534 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="63769534"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 63769534; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=63769534]").text(description); $(".js-view-count-work_63769534").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_63769534").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="63769534"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11119" href="https://www.academia.edu/Documents/in/User_Interface">User Interface</a><script data-card-contents-for-ri="11119" type="text/json">{"id":11119,"name":"User Interface","url":"https://www.academia.edu/Documents/in/User_Interface?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=63769534]'), work: {"id":63769534,"title":"Teaching artificial intelligence and logic programming in a competitive environment","created_at":"2021-12-10T06:21:20.437-08:00","url":"https://www.academia.edu/63769534/Teaching_artificial_intelligence_and_logic_programming_in_a_competitive_environment?f_ri=2529","dom_id":"work_63769534","summary":"Abstract. Motivation plays a key role in the learning process. This paper describes an experience in the context of undergraduate teaching of Artificial Intelligence at the Computer Science Department of the Faculty of Sciences in the University of Porto. A sophisticated competition framework, which involved Prolog programmed contenders and game servers, including an appealing GUI, was developed to motivate students on the deepening of the topics covered in class. We report on the impact that such a competitive setup caused on ...","downloadable_attachments":[{"id":76083540,"asset_id":63769534,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":180421597,"first_name":"Pedro","last_name":"Ribeiro","domain_name":"independent","page_name":"PedroRibeiro407","display_name":"Pedro Ribeiro","profile_url":"https://independent.academia.edu/PedroRibeiro407?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":11119,"name":"User Interface","url":"https://www.academia.edu/Documents/in/User_Interface?f_ri=2529","nofollow":false},{"id":12318,"name":"Nursing Informatics (Education)","url":"https://www.academia.edu/Documents/in/Nursing_Informatics_Education_?f_ri=2529"},{"id":37753,"name":"Teaching","url":"https://www.academia.edu/Documents/in/Teaching?f_ri=2529"},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529"},{"id":59587,"name":"Library and Information Studies","url":"https://www.academia.edu/Documents/in/Library_and_Information_Studies?f_ri=2529"},{"id":101530,"name":"Artificial Intelligent","url":"https://www.academia.edu/Documents/in/Artificial_Intelligent?f_ri=2529"},{"id":381295,"name":"Competitive Learning","url":"https://www.academia.edu/Documents/in/Competitive_Learning?f_ri=2529"},{"id":393524,"name":"Learning Process","url":"https://www.academia.edu/Documents/in/Learning_Process?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_52698887" data-work_id="52698887" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/52698887/Temporal_logic_programming_for_assembly_sequence_planning">Temporal logic programming for assembly sequence planning</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/52698887" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d73fb2f9064b8eb72d2e2d8dddd03cbf" rel="nofollow" data-download="{"attachment_id":69839204,"asset_id":52698887,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/69839204/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="23245607" href="https://hindustanuniv.academia.edu/RajagopalanDevanathan">Rajagopalan Devanathan</a><script data-card-contents-for-user="23245607" type="text/json">{"id":23245607,"first_name":"Rajagopalan","last_name":"Devanathan","domain_name":"hindustanuniv","page_name":"RajagopalanDevanathan","display_name":"Rajagopalan Devanathan","profile_url":"https://hindustanuniv.academia.edu/RajagopalanDevanathan?f_ri=2529","photo":"https://0.academia-photos.com/23245607/17875646/17895431/s65_rajagopalan.devanathan.jpg"}</script></span></span></li><li class="js-paper-rank-work_52698887 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="52698887"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 52698887, container: ".js-paper-rank-work_52698887", }); });</script></li><li class="js-percentile-work_52698887 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 52698887; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_52698887"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_52698887 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="52698887"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 52698887; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=52698887]").text(description); $(".js-view-count-work_52698887").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_52698887").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="52698887"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="287095" href="https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning">Knowledge Representation and Reasoning</a>, <script data-card-contents-for-ri="287095" type="text/json">{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="516901" href="https://www.academia.edu/Documents/in/Constraint">Constraint</a><script data-card-contents-for-ri="516901" type="text/json">{"id":516901,"name":"Constraint","url":"https://www.academia.edu/Documents/in/Constraint?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=52698887]'), work: {"id":52698887,"title":"Temporal logic programming for assembly sequence planning","created_at":"2021-09-18T02:37:18.653-07:00","url":"https://www.academia.edu/52698887/Temporal_logic_programming_for_assembly_sequence_planning?f_ri=2529","dom_id":"work_52698887","summary":null,"downloadable_attachments":[{"id":69839204,"asset_id":52698887,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":23245607,"first_name":"Rajagopalan","last_name":"Devanathan","domain_name":"hindustanuniv","page_name":"RajagopalanDevanathan","display_name":"Rajagopalan Devanathan","profile_url":"https://hindustanuniv.academia.edu/RajagopalanDevanathan?f_ri=2529","photo":"https://0.academia-photos.com/23245607/17875646/17895431/s65_rajagopalan.devanathan.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529","nofollow":false},{"id":516901,"name":"Constraint","url":"https://www.academia.edu/Documents/in/Constraint?f_ri=2529","nofollow":false},{"id":1150876,"name":"Temporal Logic","url":"https://www.academia.edu/Documents/in/Temporal_Logic?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_12647852" data-work_id="12647852" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/12647852/Answer_Set_Programming">Answer Set Programming</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/12647852" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b195d63db69e18cffbe236018b2109b0" rel="nofollow" data-download="{"attachment_id":46030346,"asset_id":12647852,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46030346/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="31633650" href="https://independent.academia.edu/NicolaLeone1">Nicola Leone</a><script data-card-contents-for-user="31633650" type="text/json">{"id":31633650,"first_name":"Nicola","last_name":"Leone","domain_name":"independent","page_name":"NicolaLeone1","display_name":"Nicola Leone","profile_url":"https://independent.academia.edu/NicolaLeone1?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_12647852 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="12647852"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 12647852, container: ".js-paper-rank-work_12647852", }); });</script></li><li class="js-percentile-work_12647852 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 12647852; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_12647852"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_12647852 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="12647852"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 12647852; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=12647852]").text(description); $(".js-view-count-work_12647852").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_12647852").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="12647852"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22615" href="https://www.academia.edu/Documents/in/Knowledge_Representation">Knowledge Representation</a>, <script data-card-contents-for-ri="22615" type="text/json">{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="51071" href="https://www.academia.edu/Documents/in/Nonmonotonic_Reasoning">Nonmonotonic Reasoning</a><script data-card-contents-for-ri="51071" type="text/json">{"id":51071,"name":"Nonmonotonic Reasoning","url":"https://www.academia.edu/Documents/in/Nonmonotonic_Reasoning?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=12647852]'), work: {"id":12647852,"title":"Answer Set Programming","created_at":"2015-05-28T06:36:06.450-07:00","url":"https://www.academia.edu/12647852/Answer_Set_Programming?f_ri=2529","dom_id":"work_12647852","summary":null,"downloadable_attachments":[{"id":46030346,"asset_id":12647852,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":31633650,"first_name":"Nicola","last_name":"Leone","domain_name":"independent","page_name":"NicolaLeone1","display_name":"Nicola Leone","profile_url":"https://independent.academia.edu/NicolaLeone1?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false},{"id":51071,"name":"Nonmonotonic Reasoning","url":"https://www.academia.edu/Documents/in/Nonmonotonic_Reasoning?f_ri=2529","nofollow":false},{"id":84584,"name":"Answer Set Programming","url":"https://www.academia.edu/Documents/in/Answer_Set_Programming?f_ri=2529"},{"id":86845,"name":"Reasoning","url":"https://www.academia.edu/Documents/in/Reasoning?f_ri=2529"},{"id":149786,"name":"Declarative Programming","url":"https://www.academia.edu/Documents/in/Declarative_Programming?f_ri=2529"},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_12111655" data-work_id="12111655" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/12111655/Hyper_automaton_a_Model_of_Control_Algorithms">Hyper-automaton: a Model of Control Algorithms</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The hyper-automaton is introduced as a model of complex control algorithms. The model reflects basic aspects of control algorithms: presence of an external environment, cyclic and event-driven functioning, synchronism, hierarchical... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_12111655" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The hyper-automaton is introduced as a model of complex control algorithms. The model reflects basic aspects of control algorithms: presence of an external environment, cyclic and event-driven functioning, synchronism, hierarchical structure and logical parallelism. The paper introduces basic definitions and conceptual means of hyper-automaton model, which encourage program implementation of the algorithms. A new kind of functional polymorphism we name event- driven polymorphism is distinguished and discussed.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/12111655" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="160ea7a0067e1f888002a4a525a9bb83" rel="nofollow" data-download="{"attachment_id":37425434,"asset_id":12111655,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/37425434/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="30310101" href="https://nsu-ru.academia.edu/VladimirZyubin">Vladimir Zyubin</a><script data-card-contents-for-user="30310101" type="text/json">{"id":30310101,"first_name":"Vladimir","last_name":"Zyubin","domain_name":"nsu-ru","page_name":"VladimirZyubin","display_name":"Vladimir Zyubin","profile_url":"https://nsu-ru.academia.edu/VladimirZyubin?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_12111655 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="12111655"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 12111655, container: ".js-paper-rank-work_12111655", }); });</script></li><li class="js-percentile-work_12111655 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 12111655; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_12111655"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_12111655 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="12111655"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 12111655; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=12111655]").text(description); $(".js-view-count-work_12111655").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_12111655").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="12111655"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3855" href="https://www.academia.edu/Documents/in/Polymorphism">Polymorphism</a>, <script data-card-contents-for-ri="3855" type="text/json">{"id":3855,"name":"Polymorphism","url":"https://www.academia.edu/Documents/in/Polymorphism?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6177" href="https://www.academia.edu/Documents/in/Modeling">Modeling</a>, <script data-card-contents-for-ri="6177" type="text/json">{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="12428" href="https://www.academia.edu/Documents/in/Automatic_Control">Automatic Control</a><script data-card-contents-for-ri="12428" type="text/json">{"id":12428,"name":"Automatic Control","url":"https://www.academia.edu/Documents/in/Automatic_Control?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=12111655]'), work: {"id":12111655,"title":"Hyper-automaton: a Model of Control Algorithms","created_at":"2015-04-26T06:50:28.630-07:00","url":"https://www.academia.edu/12111655/Hyper_automaton_a_Model_of_Control_Algorithms?f_ri=2529","dom_id":"work_12111655","summary":"The hyper-automaton is introduced as a model of complex control algorithms. The model reflects basic aspects of control algorithms: presence of an external environment, cyclic and event-driven functioning, synchronism, hierarchical structure and logical parallelism. The paper introduces basic definitions and conceptual means of hyper-automaton model, which encourage program implementation of the algorithms. A new kind of functional polymorphism we name event- driven polymorphism is distinguished and discussed.","downloadable_attachments":[{"id":37425434,"asset_id":12111655,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":30310101,"first_name":"Vladimir","last_name":"Zyubin","domain_name":"nsu-ru","page_name":"VladimirZyubin","display_name":"Vladimir Zyubin","profile_url":"https://nsu-ru.academia.edu/VladimirZyubin?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":3855,"name":"Polymorphism","url":"https://www.academia.edu/Documents/in/Polymorphism?f_ri=2529","nofollow":false},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=2529","nofollow":false},{"id":12428,"name":"Automatic Control","url":"https://www.academia.edu/Documents/in/Automatic_Control?f_ri=2529","nofollow":false},{"id":23018,"name":"Digital Control","url":"https://www.academia.edu/Documents/in/Digital_Control?f_ri=2529"},{"id":30596,"name":"Control Systems","url":"https://www.academia.edu/Documents/in/Control_Systems?f_ri=2529"},{"id":57186,"name":"Actuators","url":"https://www.academia.edu/Documents/in/Actuators?f_ri=2529"},{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=2529"},{"id":109295,"name":"Automata Theory","url":"https://www.academia.edu/Documents/in/Automata_Theory?f_ri=2529"},{"id":179832,"name":"Programmable logic controllers","url":"https://www.academia.edu/Documents/in/Programmable_logic_controllers?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3413718" data-work_id="3413718" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3413718/%D0%9F%D0%BE%D0%B4%D0%B3%D0%BE%D1%82%D0%BE%D0%B2%D0%BA%D0%B0_%D0%BA_%D1%8D%D0%BA%D0%B7%D0%B0%D0%BC%D0%B5%D0%BD%D1%83_%D0%BF%D0%BE_%D0%BA%D1%83%D1%80%D1%81%D1%83_%D0%9B%D0%BE%D0%B3%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B5_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_Exam_for_the_course_Logic_Programming_">Подготовка к экзамену по курсу «Логическое программирование» (Exam for the course "Logic Programming")</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3413718" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="eab31593d25bab72b68004b2916b2d3b" rel="nofollow" data-download="{"attachment_id":31192694,"asset_id":3413718,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31192694/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3265236" href="https://mai.academia.edu/w495">Ilya (w-495) Nikitin</a><script data-card-contents-for-user="3265236" type="text/json">{"id":3265236,"first_name":"Ilya (w-495)","last_name":"Nikitin","domain_name":"mai","page_name":"w495","display_name":"Ilya (w-495) Nikitin","profile_url":"https://mai.academia.edu/w495?f_ri=2529","photo":"https://gravatar.com/avatar/c63c4a2cee556ab011801e389f20486d?s=65"}</script></span></span></li><li class="js-paper-rank-work_3413718 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3413718"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3413718, container: ".js-paper-rank-work_3413718", }); });</script></li><li class="js-percentile-work_3413718 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3413718; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3413718"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3413718 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3413718"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3413718; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3413718]").text(description); $(".js-view-count-work_3413718").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3413718").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3413718"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="451" href="https://www.academia.edu/Documents/in/Programming_Languages">Programming Languages</a>, <script data-card-contents-for-ri="451" type="text/json">{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="52558" href="https://www.academia.edu/Documents/in/Prolog">Prolog</a><script data-card-contents-for-ri="52558" type="text/json">{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3413718]'), work: {"id":3413718,"title":"Подготовка к экзамену по курсу «Логическое программирование» (Exam for the course \"Logic Programming\")","created_at":"2013-04-28T16:42:49.630-07:00","url":"https://www.academia.edu/3413718/%D0%9F%D0%BE%D0%B4%D0%B3%D0%BE%D1%82%D0%BE%D0%B2%D0%BA%D0%B0_%D0%BA_%D1%8D%D0%BA%D0%B7%D0%B0%D0%BC%D0%B5%D0%BD%D1%83_%D0%BF%D0%BE_%D0%BA%D1%83%D1%80%D1%81%D1%83_%D0%9B%D0%BE%D0%B3%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B5_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_Exam_for_the_course_Logic_Programming_?f_ri=2529","dom_id":"work_3413718","summary":null,"downloadable_attachments":[{"id":31192694,"asset_id":3413718,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3265236,"first_name":"Ilya (w-495)","last_name":"Nikitin","domain_name":"mai","page_name":"w495","display_name":"Ilya (w-495) Nikitin","profile_url":"https://mai.academia.edu/w495?f_ri=2529","photo":"https://gravatar.com/avatar/c63c4a2cee556ab011801e389f20486d?s=65"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=2529"},{"id":102173,"name":"Functional Logic Programming","url":"https://www.academia.edu/Documents/in/Functional_Logic_Programming?f_ri=2529"},{"id":378440,"name":"Logic and Declarative Programming","url":"https://www.academia.edu/Documents/in/Logic_and_Declarative_Programming?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_42793781" data-work_id="42793781" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/42793781/RECOMMENDATIONS_TO_DECISION_MAKERS_ACT_Sustainable_Energy_Policy">RECOMMENDATIONS TO DECISION MAKERS: ACT Sustainable Energy Policy</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">White Paper C discusses: (a) key recommendations to the decision-makers; (b) understanding the risks; (c) scenario planning at the policy level; (d) future scenarios and recommendations; (e) conclusion. This white paper examines the... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_42793781" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">White Paper C discusses: (a) key recommendations to the decision-makers; (b) understanding the risks; (c) scenario planning at the policy level; (d) future scenarios and recommendations; (e) conclusion. This white paper examines the A.C.T. Sustainable Energy Policy.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/42793781" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="bc865c781dc2be7956c6168eadcb1327" rel="nofollow" data-download="{"attachment_id":63020343,"asset_id":42793781,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/63020343/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="49234363" href="https://surveymonkey.academia.edu/NeilsenCampit">Neilsen Campit</a><script data-card-contents-for-user="49234363" type="text/json">{"id":49234363,"first_name":"Neilsen","last_name":"Campit","domain_name":"surveymonkey","page_name":"NeilsenCampit","display_name":"Neilsen Campit","profile_url":"https://surveymonkey.academia.edu/NeilsenCampit?f_ri=2529","photo":"https://0.academia-photos.com/49234363/39953619/39397362/s65_neilsen.campit.jpg"}</script></span></span></li><li class="js-paper-rank-work_42793781 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="42793781"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 42793781, container: ".js-paper-rank-work_42793781", }); });</script></li><li class="js-percentile-work_42793781 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 42793781; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_42793781"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_42793781 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="42793781"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 42793781; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=42793781]").text(description); $(".js-view-count-work_42793781").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_42793781").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="42793781"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">5</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3477" href="https://www.academia.edu/Documents/in/Strategic_Foresight">Strategic Foresight</a>, <script data-card-contents-for-ri="3477" type="text/json">{"id":3477,"name":"Strategic Foresight","url":"https://www.academia.edu/Documents/in/Strategic_Foresight?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3709" href="https://www.academia.edu/Documents/in/Evidence_Based_Practice">Evidence Based Practice</a>, <script data-card-contents-for-ri="3709" type="text/json">{"id":3709,"name":"Evidence Based Practice","url":"https://www.academia.edu/Documents/in/Evidence_Based_Practice?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="18289" href="https://www.academia.edu/Documents/in/Scenario_planning">Scenario planning</a><script data-card-contents-for-ri="18289" type="text/json">{"id":18289,"name":"Scenario planning","url":"https://www.academia.edu/Documents/in/Scenario_planning?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=42793781]'), work: {"id":42793781,"title":"RECOMMENDATIONS TO DECISION MAKERS: ACT Sustainable Energy Policy","created_at":"2020-04-20T01:39:51.937-07:00","url":"https://www.academia.edu/42793781/RECOMMENDATIONS_TO_DECISION_MAKERS_ACT_Sustainable_Energy_Policy?f_ri=2529","dom_id":"work_42793781","summary":"White Paper C discusses: (a) key recommendations to the decision-makers; (b) understanding the risks; (c) scenario planning at the policy level; (d) future scenarios and recommendations; (e) conclusion. This white paper examines the A.C.T. Sustainable Energy Policy. ","downloadable_attachments":[{"id":63020343,"asset_id":42793781,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":49234363,"first_name":"Neilsen","last_name":"Campit","domain_name":"surveymonkey","page_name":"NeilsenCampit","display_name":"Neilsen Campit","profile_url":"https://surveymonkey.academia.edu/NeilsenCampit?f_ri=2529","photo":"https://0.academia-photos.com/49234363/39953619/39397362/s65_neilsen.campit.jpg"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":3477,"name":"Strategic Foresight","url":"https://www.academia.edu/Documents/in/Strategic_Foresight?f_ri=2529","nofollow":false},{"id":3709,"name":"Evidence Based Practice","url":"https://www.academia.edu/Documents/in/Evidence_Based_Practice?f_ri=2529","nofollow":false},{"id":18289,"name":"Scenario planning","url":"https://www.academia.edu/Documents/in/Scenario_planning?f_ri=2529","nofollow":false},{"id":131793,"name":"White Paper","url":"https://www.academia.edu/Documents/in/White_Paper?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6841535" data-work_id="6841535" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6841535/What_you_Always_Wanted_to_Know_About_Datalog_And_Never_Dared_to_Ask">What you Always Wanted to Know About Datalog (And Never Dared to Ask</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6841535" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="9c2d630b960be729d5e7f5dc21c523da" rel="nofollow" data-download="{"attachment_id":48703940,"asset_id":6841535,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48703940/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="11415592" href="https://independent.academia.edu/LetiziaTanca">Letizia Tanca</a><script data-card-contents-for-user="11415592" type="text/json">{"id":11415592,"first_name":"Letizia","last_name":"Tanca","domain_name":"independent","page_name":"LetiziaTanca","display_name":"Letizia Tanca","profile_url":"https://independent.academia.edu/LetiziaTanca?f_ri=2529","photo":"https://0.academia-photos.com/11415592/7893943/8844129/s65_letizia.tanca.jpg_oh_c65e84f453976387f337d5a2c7ab051c_oe_557ccd96___gda___1434532217_29e737c77655a48b8ac1a2ed52be0c77"}</script></span></span></li><li class="js-paper-rank-work_6841535 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6841535"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6841535, container: ".js-paper-rank-work_6841535", }); });</script></li><li class="js-percentile-work_6841535 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6841535; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6841535"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6841535 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6841535"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6841535; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6841535]").text(description); $(".js-view-count-work_6841535").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6841535").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6841535"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="460" href="https://www.academia.edu/Documents/in/Relational_Database">Relational Database</a>, <script data-card-contents-for-ri="460" type="text/json">{"id":460,"name":"Relational Database","url":"https://www.academia.edu/Documents/in/Relational_Database?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2349" href="https://www.academia.edu/Documents/in/Semantics">Semantics</a>, <script data-card-contents-for-ri="2349" type="text/json">{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6841535]'), work: {"id":6841535,"title":"What you Always Wanted to Know About Datalog (And Never Dared to Ask","created_at":"2014-04-22T22:12:42.623-07:00","url":"https://www.academia.edu/6841535/What_you_Always_Wanted_to_Know_About_Datalog_And_Never_Dared_to_Ask?f_ri=2529","dom_id":"work_6841535","summary":null,"downloadable_attachments":[{"id":48703940,"asset_id":6841535,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":11415592,"first_name":"Letizia","last_name":"Tanca","domain_name":"independent","page_name":"LetiziaTanca","display_name":"Letizia Tanca","profile_url":"https://independent.academia.edu/LetiziaTanca?f_ri=2529","photo":"https://0.academia-photos.com/11415592/7893943/8844129/s65_letizia.tanca.jpg_oh_c65e84f453976387f337d5a2c7ab051c_oe_557ccd96___gda___1434532217_29e737c77655a48b8ac1a2ed52be0c77"}],"research_interests":[{"id":460,"name":"Relational Database","url":"https://www.academia.edu/Documents/in/Relational_Database?f_ri=2529","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":6671,"name":"Syntax","url":"https://www.academia.edu/Documents/in/Syntax?f_ri=2529"},{"id":30735,"name":"Query Optimization","url":"https://www.academia.edu/Documents/in/Query_Optimization?f_ri=2529"},{"id":208882,"name":"Database Query","url":"https://www.academia.edu/Documents/in/Database_Query?f_ri=2529"},{"id":360413,"name":"Merging","url":"https://www.academia.edu/Documents/in/Merging?f_ri=2529"},{"id":440261,"name":"Query Languages","url":"https://www.academia.edu/Documents/in/Query_Languages?f_ri=2529"},{"id":579787,"name":"Datalog","url":"https://www.academia.edu/Documents/in/Datalog?f_ri=2529"},{"id":836786,"name":"Relational databases","url":"https://www.academia.edu/Documents/in/Relational_databases?f_ri=2529"},{"id":976400,"name":"Database Languages","url":"https://www.academia.edu/Documents/in/Database_Languages?f_ri=2529"},{"id":2294478,"name":"Deductive Databases","url":"https://www.academia.edu/Documents/in/Deductive_Databases?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11120408" data-work_id="11120408" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11120408/Synthesis_of_Minimal_Binary_Decision_Trees">Synthesis of Minimal Binary Decision Trees</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11120408" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d969bbefd212179f1ee6fc35b29a9e85" rel="nofollow" data-download="{"attachment_id":46884503,"asset_id":11120408,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46884503/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="26859465" href="https://independent.academia.edu/EDUARDOSANCHEZ51">EDUARDO SANCHEZ</a><script data-card-contents-for-user="26859465" type="text/json">{"id":26859465,"first_name":"EDUARDO","last_name":"SANCHEZ","domain_name":"independent","page_name":"EDUARDOSANCHEZ51","display_name":"EDUARDO SANCHEZ","profile_url":"https://independent.academia.edu/EDUARDOSANCHEZ51?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_11120408 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11120408"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11120408, container: ".js-paper-rank-work_11120408", }); });</script></li><li class="js-percentile-work_11120408 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11120408; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11120408"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11120408 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11120408"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11120408; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11120408]").text(description); $(".js-view-count-work_11120408").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11120408").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11120408"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="15759" href="https://www.academia.edu/Documents/in/Computer_Hardware">Computer Hardware</a>, <script data-card-contents-for-ri="15759" type="text/json">{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="53338" href="https://www.academia.edu/Documents/in/Decision_Trees">Decision Trees</a><script data-card-contents-for-ri="53338" type="text/json">{"id":53338,"name":"Decision Trees","url":"https://www.academia.edu/Documents/in/Decision_Trees?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11120408]'), work: {"id":11120408,"title":"Synthesis of Minimal Binary Decision Trees","created_at":"2015-02-26T11:52:02.729-08:00","url":"https://www.academia.edu/11120408/Synthesis_of_Minimal_Binary_Decision_Trees?f_ri=2529","dom_id":"work_11120408","summary":null,"downloadable_attachments":[{"id":46884503,"asset_id":11120408,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":26859465,"first_name":"EDUARDO","last_name":"SANCHEZ","domain_name":"independent","page_name":"EDUARDOSANCHEZ51","display_name":"EDUARDO SANCHEZ","profile_url":"https://independent.academia.edu/EDUARDOSANCHEZ51?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":15759,"name":"Computer Hardware","url":"https://www.academia.edu/Documents/in/Computer_Hardware?f_ri=2529","nofollow":false},{"id":53338,"name":"Decision Trees","url":"https://www.academia.edu/Documents/in/Decision_Trees?f_ri=2529","nofollow":false},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=2529"},{"id":162271,"name":"Decision Tree","url":"https://www.academia.edu/Documents/in/Decision_Tree?f_ri=2529"},{"id":257674,"name":"Contabilidad","url":"https://www.academia.edu/Documents/in/Contabilidad?f_ri=2529"},{"id":588229,"name":"Characteristic Function","url":"https://www.academia.edu/Documents/in/Characteristic_Function?f_ri=2529"},{"id":1430261,"name":"Boolean Functions","url":"https://www.academia.edu/Documents/in/Boolean_Functions?f_ri=2529"},{"id":1561665,"name":"Minimization","url":"https://www.academia.edu/Documents/in/Minimization?f_ri=2529"},{"id":1735830,"name":"Boolean function","url":"https://www.academia.edu/Documents/in/Boolean_function?f_ri=2529"},{"id":2064516,"name":"Combinational Circuits","url":"https://www.academia.edu/Documents/in/Combinational_Circuits?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_10025109" data-work_id="10025109" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/10025109/Formal_methods_in_PLC_programming">Formal methods in PLC programming</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">A detailed generic model of the control design process is introduced and discussed. It is used for surveying different formal approaches in the context of PLC programming. The survey focuses on formal methods for verification and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_10025109" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">A detailed generic model of the control design process is introduced and discussed. It is used for surveying different formal approaches in the context of PLC programming. The survey focuses on formal methods for verification and validation (V&V). The varying works in this area are categorized using three criteria: the general approach (A) to the task (model based, constraint based or without a model), the formalism (F) (Petri net, automata, etc.,) used to state the formal description, and the method (M) (model-checking, reachability analysis, etc.,) used to analyze the properties. Based on these three criteria (A-F-M) a three letter code for V&V approaches is introduced. Some works from the multitude of V&V research are presented and categorized using this new system</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/10025109" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2d1e2cb852771aebd04c89e419c27bf0" rel="nofollow" data-download="{"attachment_id":47564284,"asset_id":10025109,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47564284/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="24410021" href="https://vtua.academia.edu/chethanahj">chethana h j</a><script data-card-contents-for-user="24410021" type="text/json">{"id":24410021,"first_name":"chethana","last_name":"h j","domain_name":"vtua","page_name":"chethanahj","display_name":"chethana h j","profile_url":"https://vtua.academia.edu/chethanahj?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_10025109 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="10025109"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 10025109, container: ".js-paper-rank-work_10025109", }); });</script></li><li class="js-percentile-work_10025109 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 10025109; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_10025109"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_10025109 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="10025109"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 10025109; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=10025109]").text(description); $(".js-view-count-work_10025109").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_10025109").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="10025109"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">21</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2203" href="https://www.academia.edu/Documents/in/Model_Checking">Model Checking</a>, <script data-card-contents-for-ri="2203" type="text/json">{"id":2203,"name":"Model Checking","url":"https://www.academia.edu/Documents/in/Model_Checking?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6540" href="https://www.academia.edu/Documents/in/Process_Control">Process Control</a>, <script data-card-contents-for-ri="6540" type="text/json">{"id":6540,"name":"Process Control","url":"https://www.academia.edu/Documents/in/Process_Control?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11122" href="https://www.academia.edu/Documents/in/Automata">Automata</a><script data-card-contents-for-ri="11122" type="text/json">{"id":11122,"name":"Automata","url":"https://www.academia.edu/Documents/in/Automata?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=10025109]'), work: {"id":10025109,"title":"Formal methods in PLC programming","created_at":"2015-01-05T21:58:12.818-08:00","url":"https://www.academia.edu/10025109/Formal_methods_in_PLC_programming?f_ri=2529","dom_id":"work_10025109","summary":"A detailed generic model of the control design process is introduced and discussed. It is used for surveying different formal approaches in the context of PLC programming. The survey focuses on formal methods for verification and validation (V\u0026V). The varying works in this area are categorized using three criteria: the general approach (A) to the task (model based, constraint based or without a model), the formalism (F) (Petri net, automata, etc.,) used to state the formal description, and the method (M) (model-checking, reachability analysis, etc.,) used to analyze the properties. Based on these three criteria (A-F-M) a three letter code for V\u0026V approaches is introduced. Some works from the multitude of V\u0026V research are presented and categorized using this new system","downloadable_attachments":[{"id":47564284,"asset_id":10025109,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":24410021,"first_name":"chethana","last_name":"h j","domain_name":"vtua","page_name":"chethanahj","display_name":"chethana h j","profile_url":"https://vtua.academia.edu/chethanahj?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2203,"name":"Model Checking","url":"https://www.academia.edu/Documents/in/Model_Checking?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":6540,"name":"Process Control","url":"https://www.academia.edu/Documents/in/Process_Control?f_ri=2529","nofollow":false},{"id":11122,"name":"Automata","url":"https://www.academia.edu/Documents/in/Automata?f_ri=2529","nofollow":false},{"id":11821,"name":"Verification and Validation","url":"https://www.academia.edu/Documents/in/Verification_and_Validation?f_ri=2529"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=2529"},{"id":30596,"name":"Control Systems","url":"https://www.academia.edu/Documents/in/Control_Systems?f_ri=2529"},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=2529"},{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=2529"},{"id":68570,"name":"Formalism","url":"https://www.academia.edu/Documents/in/Formalism?f_ri=2529"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=2529"},{"id":126194,"name":"Formal method","url":"https://www.academia.edu/Documents/in/Formal_method?f_ri=2529"},{"id":130383,"name":"Control Design","url":"https://www.academia.edu/Documents/in/Control_Design?f_ri=2529"},{"id":159687,"name":"Design Methodology","url":"https://www.academia.edu/Documents/in/Design_Methodology?f_ri=2529"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=2529"},{"id":179832,"name":"Programmable logic controllers","url":"https://www.academia.edu/Documents/in/Programmable_logic_controllers?f_ri=2529"},{"id":265912,"name":"Petri Net","url":"https://www.academia.edu/Documents/in/Petri_Net?f_ri=2529"},{"id":357953,"name":"PLC programming","url":"https://www.academia.edu/Documents/in/PLC_programming?f_ri=2529"},{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529"},{"id":885223,"name":"Reachability Analysis","url":"https://www.academia.edu/Documents/in/Reachability_Analysis?f_ri=2529"},{"id":2413807,"name":"Generic model","url":"https://www.academia.edu/Documents/in/Generic_model?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_37749439" data-work_id="37749439" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/37749439/ENHANCED_SPREADSHEET_COMPUTING_WITH_FINITE_DOMAIN_CONSTRAINT_SATISFACTION">ENHANCED SPREADSHEET COMPUTING WITH FINITE- DOMAIN CONSTRAINT SATISFACTION</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The spreadsheet application is among the most widely used computing tools in the modern society. It provides great usability and usefulness, and it easily enables a non-programmer to perform programming-like tasks in a visual tabular "... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_37749439" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The spreadsheet application is among the most widely used computing tools in the modern society. It provides great usability and usefulness, and it easily enables a non-programmer to perform programming-like tasks in a visual tabular " pen and paper " approach. However, due to its mono-directional dataflow, spreadsheets are mostly limited to bookkeeping-like applications. This paper shows how the spreadsheet computing paradigm is extended to break through this limitation for solving constraint satisfaction problems. We present an enhanced spreadsheet system where finite-domain constraint solving is well supported in a visual environment. A spreadsheet-specific constraint language is constructed for general users to specify constraints among data cells in a declarative and scalable way. The new spreadsheet system significantly simplifies the development of many constraint-based applications using a visual tabular interface. Examples are given to illustrate the usability and usefulness of the extended spreadsheet paradigm.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/37749439" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="569f566e8d8d004bcc4a15132cf3f13c" rel="nofollow" data-download="{"attachment_id":57745132,"asset_id":37749439,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/57745132/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="21345587" href="https://independent.academia.edu/IJPLAJournal">International Journal of Programming Languages and Applications ( IJPLA )</a><script data-card-contents-for-user="21345587" type="text/json">{"id":21345587,"first_name":"International Journal of Programming Languages and Applications","last_name":"( IJPLA )","domain_name":"independent","page_name":"IJPLAJournal","display_name":"International Journal of Programming Languages and Applications ( IJPLA )","profile_url":"https://independent.academia.edu/IJPLAJournal?f_ri=2529","photo":"https://0.academia-photos.com/21345587/7069053/27970360/s65_international_journal_of_programming_languages_and_applications._ijpla_.jpg"}</script></span></span></li><li class="js-paper-rank-work_37749439 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="37749439"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 37749439, container: ".js-paper-rank-work_37749439", }); });</script></li><li class="js-percentile-work_37749439 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 37749439; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_37749439"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_37749439 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="37749439"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 37749439; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=37749439]").text(description); $(".js-view-count-work_37749439").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_37749439").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="37749439"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="441" href="https://www.academia.edu/Documents/in/Grid_Computing">Grid Computing</a>, <script data-card-contents-for-ri="441" type="text/json">{"id":441,"name":"Grid Computing","url":"https://www.academia.edu/Documents/in/Grid_Computing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20858" href="https://www.academia.edu/Documents/in/Inductive_Logic_Programming">Inductive Logic Programming</a>, <script data-card-contents-for-ri="20858" type="text/json">{"id":20858,"name":"Inductive Logic Programming","url":"https://www.academia.edu/Documents/in/Inductive_Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26860" href="https://www.academia.edu/Documents/in/Cloud_Computing">Cloud Computing</a><script data-card-contents-for-ri="26860" type="text/json">{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=37749439]'), work: {"id":37749439,"title":"ENHANCED SPREADSHEET COMPUTING WITH FINITE- DOMAIN CONSTRAINT SATISFACTION","created_at":"2018-11-12T00:12:39.403-08:00","url":"https://www.academia.edu/37749439/ENHANCED_SPREADSHEET_COMPUTING_WITH_FINITE_DOMAIN_CONSTRAINT_SATISFACTION?f_ri=2529","dom_id":"work_37749439","summary":"The spreadsheet application is among the most widely used computing tools in the modern society. It provides great usability and usefulness, and it easily enables a non-programmer to perform programming-like tasks in a visual tabular \" pen and paper \" approach. However, due to its mono-directional dataflow, spreadsheets are mostly limited to bookkeeping-like applications. This paper shows how the spreadsheet computing paradigm is extended to break through this limitation for solving constraint satisfaction problems. We present an enhanced spreadsheet system where finite-domain constraint solving is well supported in a visual environment. A spreadsheet-specific constraint language is constructed for general users to specify constraints among data cells in a declarative and scalable way. The new spreadsheet system significantly simplifies the development of many constraint-based applications using a visual tabular interface. Examples are given to illustrate the usability and usefulness of the extended spreadsheet paradigm.","downloadable_attachments":[{"id":57745132,"asset_id":37749439,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":21345587,"first_name":"International Journal of Programming Languages and Applications","last_name":"( IJPLA )","domain_name":"independent","page_name":"IJPLAJournal","display_name":"International Journal of Programming Languages and Applications ( IJPLA )","profile_url":"https://independent.academia.edu/IJPLAJournal?f_ri=2529","photo":"https://0.academia-photos.com/21345587/7069053/27970360/s65_international_journal_of_programming_languages_and_applications._ijpla_.jpg"}],"research_interests":[{"id":441,"name":"Grid Computing","url":"https://www.academia.edu/Documents/in/Grid_Computing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":20858,"name":"Inductive Logic Programming","url":"https://www.academia.edu/Documents/in/Inductive_Logic_Programming?f_ri=2529","nofollow":false},{"id":26860,"name":"Cloud Computing","url":"https://www.academia.edu/Documents/in/Cloud_Computing?f_ri=2529","nofollow":false},{"id":62225,"name":"Fuzzy Logic Programming","url":"https://www.academia.edu/Documents/in/Fuzzy_Logic_Programming?f_ri=2529"},{"id":90093,"name":"Constraint Satisfaction Problems","url":"https://www.academia.edu/Documents/in/Constraint_Satisfaction_Problems?f_ri=2529"},{"id":102173,"name":"Functional Logic Programming","url":"https://www.academia.edu/Documents/in/Functional_Logic_Programming?f_ri=2529"},{"id":378440,"name":"Logic and Declarative Programming","url":"https://www.academia.edu/Documents/in/Logic_and_Declarative_Programming?f_ri=2529"},{"id":408796,"name":"Spreadsheet Research","url":"https://www.academia.edu/Documents/in/Spreadsheet_Research?f_ri=2529"},{"id":483134,"name":"Distributed Constraint Satisfaction Problem","url":"https://www.academia.edu/Documents/in/Distributed_Constraint_Satisfaction_Problem?f_ri=2529"},{"id":779564,"name":"Constraint Logic Programming","url":"https://www.academia.edu/Documents/in/Constraint_Logic_Programming?f_ri=2529"},{"id":1310809,"name":"Excel Spreadsheets","url":"https://www.academia.edu/Documents/in/Excel_Spreadsheets?f_ri=2529"},{"id":1635007,"name":"Constraint Satisfaction In Dynamic Web Service Composition Nizamuddin Channa","url":"https://www.academia.edu/Documents/in/Constraint_Satisfaction_In_Dynamic_Web_Service_Composition_Nizamuddin_Channa?f_ri=2529"},{"id":1638973,"name":"Logical Programming","url":"https://www.academia.edu/Documents/in/Logical_Programming?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_44711128" data-work_id="44711128" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/44711128/Artificial_Intelligence_and_Machine_Learning">Artificial Intelligence and Machine Learning</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Thanks to more powerful hardware and a new generation of learning algorithms, artificial intelligence is supporting the automation of a number of tasks and activities that are changing the job landscape as much as they have impacted on... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_44711128" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Thanks to more powerful hardware and a new generation of learning algorithms, artificial intelligence is supporting the automation of a number of tasks and activities that are changing the job landscape as much as they have impacted on our everyday life. The first part of the chapter introduces artificial intelligence from its origins: its definition and its main research and application areas. The nature and the importance of machine learning for artificial intelligence applications are presented in the second part of the chapter. Existing approaches to machine learning are also classified and illustrated. The third part describes artificial intelligence tools and solutions by supported functionalities and automated tasks. Cases of applications in tourism are provided, from the best known and widely adopted, e.g., personal assistants, to the most challenging, i.e., semantic systems. Future trends and risks related to the applications of artificial intelligence are considered in the last part of the chapter.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/44711128" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1167592" href="https://unitn.academia.edu/LuisaMich">Luisa Mich</a><script data-card-contents-for-user="1167592" type="text/json">{"id":1167592,"first_name":"Luisa","last_name":"Mich","domain_name":"unitn","page_name":"LuisaMich","display_name":"Luisa Mich","profile_url":"https://unitn.academia.edu/LuisaMich?f_ri=2529","photo":"https://0.academia-photos.com/1167592/413931/18919239/s65_luisa.mich.jpg"}</script></span></span></li><li class="js-paper-rank-work_44711128 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="44711128"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 44711128, container: ".js-paper-rank-work_44711128", }); });</script></li><li class="js-percentile-work_44711128 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 44711128; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_44711128"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_44711128 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="44711128"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 44711128; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=44711128]").text(description); $(".js-view-count-work_44711128").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_44711128").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="44711128"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">15</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="454" href="https://www.academia.edu/Documents/in/Functional_Programming">Functional Programming</a>, <script data-card-contents-for-ri="454" type="text/json">{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="470" href="https://www.academia.edu/Documents/in/Expert_Systems">Expert Systems</a>, <script data-card-contents-for-ri="470" type="text/json">{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2008" href="https://www.academia.edu/Documents/in/Machine_Learning">Machine Learning</a><script data-card-contents-for-ri="2008" type="text/json">{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=44711128]'), work: {"id":44711128,"title":"Artificial Intelligence and Machine Learning","created_at":"2020-12-15T09:52:24.942-08:00","url":"https://www.academia.edu/44711128/Artificial_Intelligence_and_Machine_Learning?f_ri=2529","dom_id":"work_44711128","summary":"Thanks to more powerful hardware and a new generation of learning algorithms, artificial intelligence is supporting the automation of a number of tasks and activities that are changing the job landscape as much as they have impacted on our everyday life. The first part of the chapter introduces artificial intelligence from its origins: its definition and its main research and application areas. The nature and the importance of machine learning for artificial intelligence applications are presented in the second part of the chapter. Existing approaches to machine learning are also classified and illustrated. The third part describes artificial intelligence tools and solutions by supported functionalities and automated tasks. Cases of applications in tourism are provided, from the best known and widely adopted, e.g., personal assistants, to the most challenging, i.e., semantic systems. Future trends and risks related to the applications of artificial intelligence are considered in the last part of the chapter.","downloadable_attachments":[],"ordered_authors":[{"id":1167592,"first_name":"Luisa","last_name":"Mich","domain_name":"unitn","page_name":"LuisaMich","display_name":"Luisa Mich","profile_url":"https://unitn.academia.edu/LuisaMich?f_ri=2529","photo":"https://0.academia-photos.com/1167592/413931/18919239/s65_luisa.mich.jpg"}],"research_interests":[{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=2529","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false},{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":10516,"name":"Etourism","url":"https://www.academia.edu/Documents/in/Etourism?f_ri=2529"},{"id":20641,"name":"Future of artificial intelligence","url":"https://www.academia.edu/Documents/in/Future_of_artificial_intelligence?f_ri=2529"},{"id":27006,"name":"Supervised Learning Techniques","url":"https://www.academia.edu/Documents/in/Supervised_Learning_Techniques?f_ri=2529"},{"id":27008,"name":"Unsupervised Learning Techniques","url":"https://www.academia.edu/Documents/in/Unsupervised_Learning_Techniques?f_ri=2529"},{"id":54123,"name":"Artificial Neural Networks","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Networks?f_ri=2529"},{"id":71155,"name":"History of Computer Sciences","url":"https://www.academia.edu/Documents/in/History_of_Computer_Sciences?f_ri=2529"},{"id":89919,"name":"Robots","url":"https://www.academia.edu/Documents/in/Robots?f_ri=2529"},{"id":105744,"name":"IBM Watson","url":"https://www.academia.edu/Documents/in/IBM_Watson?f_ri=2529"},{"id":110971,"name":"Chatbots","url":"https://www.academia.edu/Documents/in/Chatbots?f_ri=2529"},{"id":246161,"name":"Virtual Assistant","url":"https://www.academia.edu/Documents/in/Virtual_Assistant?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_39589256" data-work_id="39589256" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/39589256/%D0%9D%D0%BE%D1%82%D0%B0%D1%86%D0%B8%D1%8F_%D1%81%D0%B2%D1%8F%D0%B7%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_BrainFogicTag_1_BFT_0_0_%D0%B4%D0%BE%D0%BF%D0%BE%D0%BB%D0%BD%D1%8F%D1%8E%D1%89%D0%B8%D1%85_%D0%BA%D0%BE%D0%BD%D1%82%D0%B5%D0%BA%D1%81%D1%82_%D0%B5%D1%81%D1%82%D0%B5%D1%81%D1%82%D0%B2%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE_%D1%82%D0%B5%D0%BA%D1%81%D1%82%D0%B0">Нотация связанных данных BrainFogicTag 1[.] BFT 0[0] дополняющих контекст естественного текста</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Искусственная нотации BFT предназначена для улучшения коммуникации между носителями различных формальных систем. Нотация дополняет текст логическими конструкциями удобными для осмысленного чтения и одновременно пригодными для машинного... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_39589256" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Искусственная нотации BFT предназначена для улучшения коммуникации между носителями различных формальных систем. Нотация дополняет текст логическими конструкциями удобными для осмысленного чтения и одновременно пригодными для машинного анализа. В отличие от иерархической разметки знаний формата XML или JSON-LD, предложенный формат BFT имеет сетевую модель.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/39589256" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b4fc2d897d690b6bcd489f9b178b9d6d" rel="nofollow" data-download="{"attachment_id":59743433,"asset_id":39589256,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/59743433/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4357340" href="https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3">Гудаев Олег</a><script data-card-contents-for-user="4357340" type="text/json">{"id":4357340,"first_name":"Гудаев","last_name":"Олег","domain_name":"donntu","page_name":"ГудаевОлег","display_name":"Гудаев Олег","profile_url":"https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3?f_ri=2529","photo":"https://0.academia-photos.com/4357340/1756086/2099501/s65__._.jpg"}</script></span></span></li><li class="js-paper-rank-work_39589256 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="39589256"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 39589256, container: ".js-paper-rank-work_39589256", }); });</script></li><li class="js-percentile-work_39589256 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 39589256; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_39589256"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_39589256 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="39589256"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 39589256; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=39589256]").text(description); $(".js-view-count-work_39589256").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_39589256").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="39589256"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="805" href="https://www.academia.edu/Documents/in/Ontology">Ontology</a>, <script data-card-contents-for-ri="805" type="text/json">{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1200" href="https://www.academia.edu/Documents/in/Languages_and_Linguistics">Languages and Linguistics</a>, <script data-card-contents-for-ri="1200" type="text/json">{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1432" href="https://www.academia.edu/Documents/in/Natural_Language_Processing">Natural Language Processing</a>, <script data-card-contents-for-ri="1432" type="text/json">{"id":1432,"name":"Natural Language Processing","url":"https://www.academia.edu/Documents/in/Natural_Language_Processing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=39589256]'), work: {"id":39589256,"title":"Нотация связанных данных BrainFogicTag 1[.] BFT 0[0] дополняющих контекст естественного текста","created_at":"2019-06-15T09:13:06.860-07:00","url":"https://www.academia.edu/39589256/%D0%9D%D0%BE%D1%82%D0%B0%D1%86%D0%B8%D1%8F_%D1%81%D0%B2%D1%8F%D0%B7%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_BrainFogicTag_1_BFT_0_0_%D0%B4%D0%BE%D0%BF%D0%BE%D0%BB%D0%BD%D1%8F%D1%8E%D1%89%D0%B8%D1%85_%D0%BA%D0%BE%D0%BD%D1%82%D0%B5%D0%BA%D1%81%D1%82_%D0%B5%D1%81%D1%82%D0%B5%D1%81%D1%82%D0%B2%D0%B5%D0%BD%D0%BD%D0%BE%D0%B3%D0%BE_%D1%82%D0%B5%D0%BA%D1%81%D1%82%D0%B0?f_ri=2529","dom_id":"work_39589256","summary":"Искусственная нотации BFT предназначена для улучшения коммуникации между носителями различных формальных систем. Нотация дополняет текст логическими конструкциями удобными для осмысленного чтения и одновременно пригодными для машинного анализа. В отличие от иерархической разметки знаний формата XML или JSON-LD, предложенный формат BFT имеет сетевую модель.","downloadable_attachments":[{"id":59743433,"asset_id":39589256,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4357340,"first_name":"Гудаев","last_name":"Олег","domain_name":"donntu","page_name":"ГудаевОлег","display_name":"Гудаев Олег","profile_url":"https://donntu.academia.edu/%D0%93%D1%83%D0%B4%D0%B0%D0%B5%D0%B2%D0%9E%D0%BB%D0%B5%D0%B3?f_ri=2529","photo":"https://0.academia-photos.com/4357340/1756086/2099501/s65__._.jpg"}],"research_interests":[{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=2529","nofollow":false},{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=2529","nofollow":false},{"id":1432,"name":"Natural Language Processing","url":"https://www.academia.edu/Documents/in/Natural_Language_Processing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":11732,"name":"Linked Data","url":"https://www.academia.edu/Documents/in/Linked_Data?f_ri=2529"},{"id":43235,"name":"Formal grammars","url":"https://www.academia.edu/Documents/in/Formal_grammars?f_ri=2529"},{"id":92738,"name":"Text Analysis","url":"https://www.academia.edu/Documents/in/Text_Analysis?f_ri=2529"},{"id":320330,"name":"Constructing Social Networks","url":"https://www.academia.edu/Documents/in/Constructing_Social_Networks?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14995988" data-work_id="14995988" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14995988/A_standard_for_software_documentation">A standard for software documentation</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14995988" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="43ae71b29a9017fd20fda76015b0c326" rel="nofollow" data-download="{"attachment_id":43667578,"asset_id":14995988,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43667578/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="31955997" href="https://syr.academia.edu/VirPhoha">Vir Phoha</a><script data-card-contents-for-user="31955997" type="text/json">{"id":31955997,"first_name":"Vir","last_name":"Phoha","domain_name":"syr","page_name":"VirPhoha","display_name":"Vir Phoha","profile_url":"https://syr.academia.edu/VirPhoha?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_14995988 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14995988"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14995988, container: ".js-paper-rank-work_14995988", }); });</script></li><li class="js-percentile-work_14995988 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14995988; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14995988"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14995988 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14995988"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14995988; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14995988]").text(description); $(".js-view-count-work_14995988").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14995988").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14995988"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2725" href="https://www.academia.edu/Documents/in/Documentation">Documentation</a>, <script data-card-contents-for-ri="2725" type="text/json">{"id":2725,"name":"Documentation","url":"https://www.academia.edu/Documents/in/Documentation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8129" href="https://www.academia.edu/Documents/in/Software_Development">Software Development</a><script data-card-contents-for-ri="8129" type="text/json">{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14995988]'), work: {"id":14995988,"title":"A standard for software documentation","created_at":"2015-08-17T19:03:26.682-07:00","url":"https://www.academia.edu/14995988/A_standard_for_software_documentation?f_ri=2529","dom_id":"work_14995988","summary":null,"downloadable_attachments":[{"id":43667578,"asset_id":14995988,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":31955997,"first_name":"Vir","last_name":"Phoha","domain_name":"syr","page_name":"VirPhoha","display_name":"Vir Phoha","profile_url":"https://syr.academia.edu/VirPhoha?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":2725,"name":"Documentation","url":"https://www.academia.edu/Documents/in/Documentation?f_ri=2529","nofollow":false},{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development?f_ri=2529","nofollow":false},{"id":42095,"name":"Document Engineering","url":"https://www.academia.edu/Documents/in/Document_Engineering?f_ri=2529"},{"id":291387,"name":"Mathematical Model","url":"https://www.academia.edu/Documents/in/Mathematical_Model?f_ri=2529"},{"id":462637,"name":"Online Monitoring","url":"https://www.academia.edu/Documents/in/Online_Monitoring?f_ri=2529"},{"id":1198057,"name":"Computer","url":"https://www.academia.edu/Documents/in/Computer?f_ri=2529"},{"id":1931321,"name":"Application Software","url":"https://www.academia.edu/Documents/in/Application_Software?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6838528" data-work_id="6838528" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6838528/Prolog_Tutorial_2">Prolog Tutorial 2</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6838528" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="36bf8abbaf31bcf8cc2a6922d96a6abf" rel="nofollow" data-download="{"attachment_id":33532692,"asset_id":6838528,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/33532692/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3828471" href="https://independent.academia.edu/CliveSpenser">Clive Spenser</a><script data-card-contents-for-user="3828471" type="text/json">{"id":3828471,"first_name":"Clive","last_name":"Spenser","domain_name":"independent","page_name":"CliveSpenser","display_name":"Clive Spenser","profile_url":"https://independent.academia.edu/CliveSpenser?f_ri=2529","photo":"https://0.academia-photos.com/3828471/1398047/1718894/s65_clive.spenser.jpg"}</script></span></span></li><li class="js-paper-rank-work_6838528 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6838528"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6838528, container: ".js-paper-rank-work_6838528", }); });</script></li><li class="js-percentile-work_6838528 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6838528; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6838528"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6838528 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6838528"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6838528; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6838528]").text(description); $(".js-view-count-work_6838528").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6838528").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6838528"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="470" href="https://www.academia.edu/Documents/in/Expert_Systems">Expert Systems</a>, <script data-card-contents-for-ri="470" type="text/json">{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="52558" href="https://www.academia.edu/Documents/in/Prolog">Prolog</a>, <script data-card-contents-for-ri="52558" type="text/json">{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="418881" href="https://www.academia.edu/Documents/in/Artifiicial_intelligence">Artifiicial intelligence</a><script data-card-contents-for-ri="418881" type="text/json">{"id":418881,"name":"Artifiicial intelligence","url":"https://www.academia.edu/Documents/in/Artifiicial_intelligence?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6838528]'), work: {"id":6838528,"title":"Prolog Tutorial 2","created_at":"2014-04-22T17:38:30.820-07:00","url":"https://www.academia.edu/6838528/Prolog_Tutorial_2?f_ri=2529","dom_id":"work_6838528","summary":null,"downloadable_attachments":[{"id":33532692,"asset_id":6838528,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3828471,"first_name":"Clive","last_name":"Spenser","domain_name":"independent","page_name":"CliveSpenser","display_name":"Clive Spenser","profile_url":"https://independent.academia.edu/CliveSpenser?f_ri=2529","photo":"https://0.academia-photos.com/3828471/1398047/1718894/s65_clive.spenser.jpg"}],"research_interests":[{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false},{"id":418881,"name":"Artifiicial intelligence","url":"https://www.academia.edu/Documents/in/Artifiicial_intelligence?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_36521379" data-work_id="36521379" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/36521379/Programaci%C3%B3n_l%C3%B3gica_Prolog_Principios_y_m%C3%A9todos_de_an%C3%A1lisis_l%C3%B3gico">Programación lógica: Prolog. Principios y métodos de análisis lógico</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Programación lógica: Prolog. Principios y métodos de análisis lógico</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/36521379" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6d742a436db060cea7dc25af4e74d843" rel="nofollow" data-download="{"attachment_id":56440125,"asset_id":36521379,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/56440125/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3669849" href="https://independent.academia.edu/rodolfojrr">Rodolfo J Rodríguez-Rodríguez</a><script data-card-contents-for-user="3669849" type="text/json">{"id":3669849,"first_name":"Rodolfo","last_name":"Rodríguez-Rodríguez","domain_name":"independent","page_name":"rodolfojrr","display_name":"Rodolfo J Rodríguez-Rodríguez","profile_url":"https://independent.academia.edu/rodolfojrr?f_ri=2529","photo":"https://0.academia-photos.com/3669849/1298525/157633889/s65_rodolfo.rodr_guez-rodr_guez.jpg"}</script></span></span></li><li class="js-paper-rank-work_36521379 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="36521379"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 36521379, container: ".js-paper-rank-work_36521379", }); });</script></li><li class="js-percentile-work_36521379 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 36521379; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_36521379"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_36521379 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="36521379"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 36521379; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=36521379]").text(description); $(".js-view-count-work_36521379").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_36521379").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="36521379"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="924" href="https://www.academia.edu/Documents/in/Logic">Logic</a>, <script data-card-contents-for-ri="924" type="text/json">{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=36521379]'), work: {"id":36521379,"title":"Programación lógica: Prolog. Principios y métodos de análisis lógico","created_at":"2018-04-27T16:08:55.649-07:00","url":"https://www.academia.edu/36521379/Programaci%C3%B3n_l%C3%B3gica_Prolog_Principios_y_m%C3%A9todos_de_an%C3%A1lisis_l%C3%B3gico?f_ri=2529","dom_id":"work_36521379","summary":"Programación lógica: Prolog. Principios y métodos de análisis lógico","downloadable_attachments":[{"id":56440125,"asset_id":36521379,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3669849,"first_name":"Rodolfo","last_name":"Rodríguez-Rodríguez","domain_name":"independent","page_name":"rodolfojrr","display_name":"Rodolfo J Rodríguez-Rodríguez","profile_url":"https://independent.academia.edu/rodolfojrr?f_ri=2529","photo":"https://0.academia-photos.com/3669849/1298525/157633889/s65_rodolfo.rodr_guez-rodr_guez.jpg"}],"research_interests":[{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1290380" data-work_id="1290380" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1290380/A_variable_threshold_voltage_inverter_for_CMOS_programmable_logic_circuits">A variable threshold voltage inverter for CMOS programmable logic circuits</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1290380" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a0e65b2defc08648937c042d8031653c" rel="nofollow" data-download="{"attachment_id":7934969,"asset_id":1290380,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/7934969/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1153767" href="https://uib-es.academia.edu/JosepLRossello">Josep L. Rossello</a><script data-card-contents-for-user="1153767" type="text/json">{"id":1153767,"first_name":"Josep L.","last_name":"Rossello","domain_name":"uib-es","page_name":"JosepLRossello","display_name":"Josep L. Rossello","profile_url":"https://uib-es.academia.edu/JosepLRossello?f_ri=2529","photo":"https://0.academia-photos.com/1153767/407147/12231383/s65_josep_l..rossello.jpg"}</script></span></span></li><li class="js-paper-rank-work_1290380 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1290380"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1290380, container: ".js-paper-rank-work_1290380", }); });</script></li><li class="js-percentile-work_1290380 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1290380; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1290380"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1290380 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1290380"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1290380; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1290380]").text(description); $(".js-view-count-work_1290380").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1290380").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1290380"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36706" href="https://www.academia.edu/Documents/in/Microcontrollers">Microcontrollers</a>, <script data-card-contents-for-ri="36706" type="text/json">{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="609191" href="https://www.academia.edu/Documents/in/Logic_Design">Logic Design</a>, <script data-card-contents-for-ri="609191" type="text/json">{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="628286" href="https://www.academia.edu/Documents/in/Logic_Gates">Logic Gates</a><script data-card-contents-for-ri="628286" type="text/json">{"id":628286,"name":"Logic Gates","url":"https://www.academia.edu/Documents/in/Logic_Gates?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1290380]'), work: {"id":1290380,"title":"A variable threshold voltage inverter for CMOS programmable logic circuits","created_at":"2012-01-25T18:17:41.382-08:00","url":"https://www.academia.edu/1290380/A_variable_threshold_voltage_inverter_for_CMOS_programmable_logic_circuits?f_ri=2529","dom_id":"work_1290380","summary":null,"downloadable_attachments":[{"id":7934969,"asset_id":1290380,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1153767,"first_name":"Josep L.","last_name":"Rossello","domain_name":"uib-es","page_name":"JosepLRossello","display_name":"Josep L. Rossello","profile_url":"https://uib-es.academia.edu/JosepLRossello?f_ri=2529","photo":"https://0.academia-photos.com/1153767/407147/12231383/s65_josep_l..rossello.jpg"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false},{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529","nofollow":false},{"id":628286,"name":"Logic Gates","url":"https://www.academia.edu/Documents/in/Logic_Gates?f_ri=2529","nofollow":false},{"id":739245,"name":"Double Gate","url":"https://www.academia.edu/Documents/in/Double_Gate?f_ri=2529"},{"id":851962,"name":"Programmable Logic","url":"https://www.academia.edu/Documents/in/Programmable_Logic?f_ri=2529"},{"id":968856,"name":"Programmable Logic Devices","url":"https://www.academia.edu/Documents/in/Programmable_Logic_Devices?f_ri=2529"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=2529"},{"id":2039711,"name":"Logic circuits","url":"https://www.academia.edu/Documents/in/Logic_circuits?f_ri=2529"},{"id":2240546,"name":"Integrated Circuit Design","url":"https://www.academia.edu/Documents/in/Integrated_Circuit_Design?f_ri=2529"},{"id":2255138,"name":"Threshold Voltage","url":"https://www.academia.edu/Documents/in/Threshold_Voltage?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7698501" data-work_id="7698501" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7698501/APLICACI%C3%93N_DE_PROGRAMACI%C3%93N_L%C3%93GICA_EN_DETECCI%C3%93N_DE_SINTAXIS_EN_EL_LENGUAJE_NATURAL">APLICACIÓN DE PROGRAMACIÓN LÓGICA EN DETECCIÓN DE SINTAXIS EN EL LENGUAJE NATURAL</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7698501" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5a8ce840a06ab3eefbb152bcdd21120e" rel="nofollow" data-download="{"attachment_id":34226558,"asset_id":7698501,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34226558/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="14035492" href="https://unc-pe.academia.edu/SantiagoIzquierdo">Santiago Izquierdo</a><script data-card-contents-for-user="14035492" type="text/json">{"id":14035492,"first_name":"Santiago","last_name":"Izquierdo","domain_name":"unc-pe","page_name":"SantiagoIzquierdo","display_name":"Santiago Izquierdo","profile_url":"https://unc-pe.academia.edu/SantiagoIzquierdo?f_ri=2529","photo":"https://0.academia-photos.com/14035492/5276881/6032638/s65_santiago.izquierdo.jpg_oh_3840509df70a4b1c74253dc9ecb54d0b_oe_54c40eda___gda___1425282538_6bbb3ce03f51fd064dbdc808cbdf6b10"}</script></span></span></li><li class="js-paper-rank-work_7698501 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7698501"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7698501, container: ".js-paper-rank-work_7698501", }); });</script></li><li class="js-percentile-work_7698501 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7698501; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7698501"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7698501 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7698501"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7698501; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7698501]").text(description); $(".js-view-count-work_7698501").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7698501").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7698501"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="83727" href="https://www.academia.edu/Documents/in/A.i">A.i</a>, <script data-card-contents-for-ri="83727" type="text/json">{"id":83727,"name":"A.i","url":"https://www.academia.edu/Documents/in/A.i?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="412691" href="https://www.academia.edu/Documents/in/A.I._Computer_Science_Consciousness">A.I.; Computer Science; Consciousness</a><script data-card-contents-for-ri="412691" type="text/json">{"id":412691,"name":"A.I.; Computer Science; Consciousness","url":"https://www.academia.edu/Documents/in/A.I._Computer_Science_Consciousness?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7698501]'), work: {"id":7698501,"title":"APLICACIÓN DE PROGRAMACIÓN LÓGICA EN DETECCIÓN DE SINTAXIS EN EL LENGUAJE NATURAL","created_at":"2014-07-17T12:54:11.367-07:00","url":"https://www.academia.edu/7698501/APLICACI%C3%93N_DE_PROGRAMACI%C3%93N_L%C3%93GICA_EN_DETECCI%C3%93N_DE_SINTAXIS_EN_EL_LENGUAJE_NATURAL?f_ri=2529","dom_id":"work_7698501","summary":null,"downloadable_attachments":[{"id":34226558,"asset_id":7698501,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":14035492,"first_name":"Santiago","last_name":"Izquierdo","domain_name":"unc-pe","page_name":"SantiagoIzquierdo","display_name":"Santiago Izquierdo","profile_url":"https://unc-pe.academia.edu/SantiagoIzquierdo?f_ri=2529","photo":"https://0.academia-photos.com/14035492/5276881/6032638/s65_santiago.izquierdo.jpg_oh_3840509df70a4b1c74253dc9ecb54d0b_oe_54c40eda___gda___1425282538_6bbb3ce03f51fd064dbdc808cbdf6b10"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":83727,"name":"A.i","url":"https://www.academia.edu/Documents/in/A.i?f_ri=2529","nofollow":false},{"id":412691,"name":"A.I.; Computer Science; Consciousness","url":"https://www.academia.edu/Documents/in/A.I._Computer_Science_Consciousness?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_454206" data-work_id="454206" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/454206/Efficient_Defeasible_Reasoning_Systems">Efficient Defeasible Reasoning Systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonicreasoning. In... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_454206" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonicreasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward-chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity, is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/454206" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8128094855535078f8631190d11fb3c8" rel="nofollow" data-download="{"attachment_id":32228275,"asset_id":454206,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/32228275/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="341994" href="https://umanitoba.academia.edu/TristanMiller">Tristan Miller</a><script data-card-contents-for-user="341994" type="text/json">{"id":341994,"first_name":"Tristan","last_name":"Miller","domain_name":"umanitoba","page_name":"TristanMiller","display_name":"Tristan Miller","profile_url":"https://umanitoba.academia.edu/TristanMiller?f_ri=2529","photo":"https://0.academia-photos.com/341994/2625996/35195379/s65_tristan.miller.jpg"}</script></span></span></li><li class="js-paper-rank-work_454206 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="454206"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 454206, container: ".js-paper-rank-work_454206", }); });</script></li><li class="js-percentile-work_454206 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 454206; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_454206"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_454206 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="454206"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 454206; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=454206]").text(description); $(".js-view-count-work_454206").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_454206").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="454206"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="491" href="https://www.academia.edu/Documents/in/Information_Technology">Information Technology</a>, <script data-card-contents-for-ri="491" type="text/json">{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2530" href="https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_">Defeasible Reasoning (Computer Science)</a><script data-card-contents-for-ri="2530" type="text/json">{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=454206]'), work: {"id":454206,"title":"Efficient Defeasible Reasoning Systems","created_at":"2011-02-23T20:02:09.904-08:00","url":"https://www.academia.edu/454206/Efficient_Defeasible_Reasoning_Systems?f_ri=2529","dom_id":"work_454206","summary":"For many years, the non-monotonic reasoning community has focussed on highly expressive logics. Such logics have turned out to be computationally expensive, and have given little support to the practical use of non-monotonicreasoning. In this work we discuss defeasible logic, a less-expressive but more efficient non-monotonic logic. We report on two new implemented systems for defeasible logic: a query answering system employing a backward-chaining approach, and a forward-chaining implementation that computes all conclusions. Our experimental evaluation demonstrates that the systems can deal with large theories (up to hundreds of thousands of rules). We show that defeasible logic has linear complexity, which contrasts markedly with most other non-monotonic logics and helps to explain the impressive experimental results. We believe that defeasible logic, with its efficiency and simplicity, is a good candidate to be used as a modelling language for practical applications, including modelling of regulations and business rules.","downloadable_attachments":[{"id":32228275,"asset_id":454206,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":341994,"first_name":"Tristan","last_name":"Miller","domain_name":"umanitoba","page_name":"TristanMiller","display_name":"Tristan Miller","profile_url":"https://umanitoba.academia.edu/TristanMiller?f_ri=2529","photo":"https://0.academia-photos.com/341994/2625996/35195379/s65_tristan.miller.jpg"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false},{"id":491,"name":"Information Technology","url":"https://www.academia.edu/Documents/in/Information_Technology?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false},{"id":51071,"name":"Nonmonotonic Reasoning","url":"https://www.academia.edu/Documents/in/Nonmonotonic_Reasoning?f_ri=2529"},{"id":91068,"name":"Non-Monotonic Reasoning","url":"https://www.academia.edu/Documents/in/Non-Monotonic_Reasoning?f_ri=2529"},{"id":96595,"name":"Unified Modelling Language","url":"https://www.academia.edu/Documents/in/Unified_Modelling_Language?f_ri=2529"},{"id":202582,"name":"Business rules","url":"https://www.academia.edu/Documents/in/Business_rules?f_ri=2529"},{"id":579771,"name":"Query Answering","url":"https://www.academia.edu/Documents/in/Query_Answering?f_ri=2529"},{"id":1249059,"name":"Electronic Commerce","url":"https://www.academia.edu/Documents/in/Electronic_Commerce?f_ri=2529"},{"id":1524628,"name":"Defeasible Logic","url":"https://www.academia.edu/Documents/in/Defeasible_Logic?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_78482621" data-work_id="78482621" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/78482621/The_Mystery_of_the_Writing_Process_A_Comparison_of_Mechanistic_and_Developmental_Organic_Writing">The Mystery of the Writing Process: A Comparison of Mechanistic and Developmental Organic Writing</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Every writer knows putting words on paper is a difficult task. Sometimes the difficulties become insurmountable. He got himself into a state of frustration in writing when the flow of ideas stopped. A writer got stuck and banged his head... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_78482621" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Every writer knows putting words on paper is a difficult task.<br />Sometimes the difficulties become insurmountable. He got<br />himself into a state of frustration in writing when the flow of ideas<br />stopped. A writer got stuck and banged his head against the wall<br />for long hours instead of writing. His struggle becomes futile<br />without getting the desired result. Despite being armed with<br />knowledge and language ability, he cannot execute his task. The<br />objective is primarily to understand the cognitive processes in<br />writing employing different approaches: mechanistic writing and<br />developmental organic writing models. This understanding is<br />derived and inferred from some learning theories such as the<br />behaviourist and mechanical models coupled with issues related<br />to the functions of brains and ‘mind’ in writing as expounded by<br />some known linguists and writers. It is hoped that by<br />understanding the cognitive processes at work in writing, anyone<br />who intends to write can benefit in terms of enhancing his writing<br />skill and making writing a challenging and enjoyable task. The<br />study is on a qualitative analysis of abook written by Peter Elbow<br />on `Writing Without Teachers` and `Writing with Power`.<br />Compared to the researchers, the data collected from his<br />experiences will embark on the meaning of `organic writing`.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/78482621" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="91db10f4c19182f56d79e4772978af22" rel="nofollow" data-download="{"attachment_id":85515400,"asset_id":78482621,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/85515400/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="6166786" href="https://iium.academia.edu/solehahyaacob">Solehah Yaacob</a><script data-card-contents-for-user="6166786" type="text/json">{"id":6166786,"first_name":"Solehah","last_name":"Yaacob","domain_name":"iium","page_name":"solehahyaacob","display_name":"Solehah Yaacob","profile_url":"https://iium.academia.edu/solehahyaacob?f_ri=2529","photo":"https://0.academia-photos.com/6166786/3006984/18954769/s65_solehah.yaacob.jpg"}</script></span></span></li><li class="js-paper-rank-work_78482621 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="78482621"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 78482621, container: ".js-paper-rank-work_78482621", }); });</script></li><li class="js-percentile-work_78482621 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 78482621; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_78482621"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_78482621 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="78482621"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 78482621; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=78482621]").text(description); $(".js-view-count-work_78482621").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_78482621").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="78482621"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">13</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="1" href="https://www.academia.edu/Documents/in/Creative_Writing">Creative Writing</a>, <script data-card-contents-for-ri="1" type="text/json">{"id":1,"name":"Creative Writing","url":"https://www.academia.edu/Documents/in/Creative_Writing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="887" href="https://www.academia.edu/Documents/in/Teaching_and_Learning">Teaching and Learning</a>, <script data-card-contents-for-ri="887" type="text/json">{"id":887,"name":"Teaching and Learning","url":"https://www.academia.edu/Documents/in/Teaching_and_Learning?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="924" href="https://www.academia.edu/Documents/in/Logic">Logic</a>, <script data-card-contents-for-ri="924" type="text/json">{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1200" href="https://www.academia.edu/Documents/in/Languages_and_Linguistics">Languages and Linguistics</a><script data-card-contents-for-ri="1200" type="text/json">{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=78482621]'), work: {"id":78482621,"title":"The Mystery of the Writing Process: A Comparison of Mechanistic and Developmental Organic Writing","created_at":"2022-05-04T22:55:17.136-07:00","url":"https://www.academia.edu/78482621/The_Mystery_of_the_Writing_Process_A_Comparison_of_Mechanistic_and_Developmental_Organic_Writing?f_ri=2529","dom_id":"work_78482621","summary":"Every writer knows putting words on paper is a difficult task.\nSometimes the difficulties become insurmountable. He got\nhimself into a state of frustration in writing when the flow of ideas\nstopped. A writer got stuck and banged his head against the wall\nfor long hours instead of writing. His struggle becomes futile\nwithout getting the desired result. Despite being armed with\nknowledge and language ability, he cannot execute his task. The\nobjective is primarily to understand the cognitive processes in\nwriting employing different approaches: mechanistic writing and\ndevelopmental organic writing models. This understanding is\nderived and inferred from some learning theories such as the\nbehaviourist and mechanical models coupled with issues related\nto the functions of brains and ‘mind’ in writing as expounded by\nsome known linguists and writers. It is hoped that by\nunderstanding the cognitive processes at work in writing, anyone\nwho intends to write can benefit in terms of enhancing his writing\nskill and making writing a challenging and enjoyable task. The\nstudy is on a qualitative analysis of abook written by Peter Elbow\non `Writing Without Teachers` and `Writing with Power`.\nCompared to the researchers, the data collected from his\nexperiences will embark on the meaning of `organic writing`.","downloadable_attachments":[{"id":85515400,"asset_id":78482621,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":6166786,"first_name":"Solehah","last_name":"Yaacob","domain_name":"iium","page_name":"solehahyaacob","display_name":"Solehah Yaacob","profile_url":"https://iium.academia.edu/solehahyaacob?f_ri=2529","photo":"https://0.academia-photos.com/6166786/3006984/18954769/s65_solehah.yaacob.jpg"}],"research_interests":[{"id":1,"name":"Creative Writing","url":"https://www.academia.edu/Documents/in/Creative_Writing?f_ri=2529","nofollow":false},{"id":887,"name":"Teaching and Learning","url":"https://www.academia.edu/Documents/in/Teaching_and_Learning?f_ri=2529","nofollow":false},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529","nofollow":false},{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":7881,"name":"Mind Brain \u0026 Education","url":"https://www.academia.edu/Documents/in/Mind_Brain_and_Education?f_ri=2529"},{"id":9919,"name":"Teaching Arabic as a Foreign Language (TAFL)","url":"https://www.academia.edu/Documents/in/Teaching_Arabic_as_a_Foreign_Language_TAFL_?f_ri=2529"},{"id":20053,"name":"Theory of Mind (Psychology)","url":"https://www.academia.edu/Documents/in/Theory_of_Mind_Psychology_?f_ri=2529"},{"id":76715,"name":"General linguistics","url":"https://www.academia.edu/Documents/in/General_linguistics?f_ri=2529"},{"id":77129,"name":"Philosphy of Language","url":"https://www.academia.edu/Documents/in/Philosphy_of_Language?f_ri=2529"},{"id":620077,"name":"English Language Teaching","url":"https://www.academia.edu/Documents/in/English_Language_Teaching-1?f_ri=2529"},{"id":1000610,"name":"Mind and Brain. Linguistic Strategies of Persuasion (Commercial","url":"https://www.academia.edu/Documents/in/Mind_and_Brain._Linguistic_Strategies_of_Persuasion_Commercial?f_ri=2529"},{"id":1031338,"name":"Analitikal dan Logikal (Analytical and Logical)","url":"https://www.academia.edu/Documents/in/Analitikal_dan_Logikal_Analytical_and_Logical_?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_49544670" data-work_id="49544670" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/49544670/Strategic_Argumentation">Strategic Argumentation</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Dialogue games are a dynamic form of argumentation, with multiple parties pooling their arguments with the intention of settling an issue. Such games can have a variety of structures, and may be collaborative or competitive, depending on... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_49544670" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Dialogue games are a dynamic form of argumentation, with multiple parties pooling their arguments with the intention of settling an issue. Such games can have a variety of structures, and may be collaborative or competitive, depending on the motivations of the parties. Strategic argumentation is a class of competitive dialogue games in which two players take turns in contributing their arguments, each attempting to have an issue settled in the way that they would prefer. Thus strategic argumentation games are less about discovering a joint truth than about a player imposing their view on an opponent. They are reflective of legal argumentation. In the games we study, players have perfect information of the moves players make, but incomplete information on the possible moves (arguments) that other players have available to them. We look both at games using logically structured arguments and games using abstract arguments. We show that playing these games can be computationally hard. We also examine issues of corruption in such games, and discuss approaches to foiling it.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/49544670" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8f6b663cc3bc571c314252a1c72c85f7" rel="nofollow" data-download="{"attachment_id":67873112,"asset_id":49544670,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/67873112/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35610951" href="https://csu-au.academia.edu/GuidoGovernatori">Guido Governatori</a><script data-card-contents-for-user="35610951" type="text/json">{"id":35610951,"first_name":"Guido","last_name":"Governatori","domain_name":"csu-au","page_name":"GuidoGovernatori","display_name":"Guido Governatori","profile_url":"https://csu-au.academia.edu/GuidoGovernatori?f_ri=2529","photo":"https://0.academia-photos.com/35610951/28014202/26259458/s65_guido.governatori.jpg"}</script></span></span></li><li class="js-paper-rank-work_49544670 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="49544670"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 49544670, container: ".js-paper-rank-work_49544670", }); });</script></li><li class="js-percentile-work_49544670 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 49544670; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_49544670"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_49544670 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="49544670"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 49544670; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=49544670]").text(description); $(".js-view-count-work_49544670").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_49544670").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="49544670"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2530" href="https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_">Defeasible Reasoning (Computer Science)</a>, <script data-card-contents-for-ri="2530" type="text/json">{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8612" href="https://www.academia.edu/Documents/in/Argumentation">Argumentation</a>, <script data-card-contents-for-ri="8612" type="text/json">{"id":8612,"name":"Argumentation","url":"https://www.academia.edu/Documents/in/Argumentation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="23036" href="https://www.academia.edu/Documents/in/Argumentation_Theory">Argumentation Theory</a><script data-card-contents-for-ri="23036" type="text/json">{"id":23036,"name":"Argumentation Theory","url":"https://www.academia.edu/Documents/in/Argumentation_Theory?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=49544670]'), work: {"id":49544670,"title":"Strategic Argumentation","created_at":"2021-07-04T20:52:53.040-07:00","url":"https://www.academia.edu/49544670/Strategic_Argumentation?f_ri=2529","dom_id":"work_49544670","summary":"Dialogue games are a dynamic form of argumentation, with multiple parties pooling their arguments with the intention of settling an issue. Such games can have a variety of structures, and may be collaborative or competitive, depending on the motivations of the parties. Strategic argumentation is a class of competitive dialogue games in which two players take turns in contributing their arguments, each attempting to have an issue settled in the way that they would prefer. Thus strategic argumentation games are less about discovering a joint truth than about a player imposing their view on an opponent. They are reflective of legal argumentation. In the games we study, players have perfect information of the moves players make, but incomplete information on the possible moves (arguments) that other players have available to them. We look both at games using logically structured arguments and games using abstract arguments. We show that playing these games can be computationally hard. We also examine issues of corruption in such games, and discuss approaches to foiling it.","downloadable_attachments":[{"id":67873112,"asset_id":49544670,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35610951,"first_name":"Guido","last_name":"Governatori","domain_name":"csu-au","page_name":"GuidoGovernatori","display_name":"Guido Governatori","profile_url":"https://csu-au.academia.edu/GuidoGovernatori?f_ri=2529","photo":"https://0.academia-photos.com/35610951/28014202/26259458/s65_guido.governatori.jpg"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false},{"id":8612,"name":"Argumentation","url":"https://www.academia.edu/Documents/in/Argumentation?f_ri=2529","nofollow":false},{"id":23036,"name":"Argumentation Theory","url":"https://www.academia.edu/Documents/in/Argumentation_Theory?f_ri=2529","nofollow":false},{"id":29847,"name":"Non-monotonic Logic","url":"https://www.academia.edu/Documents/in/Non-monotonic_Logic?f_ri=2529"},{"id":51070,"name":"Formal Models of Argument","url":"https://www.academia.edu/Documents/in/Formal_Models_of_Argument?f_ri=2529"},{"id":91068,"name":"Non-Monotonic Reasoning","url":"https://www.academia.edu/Documents/in/Non-Monotonic_Reasoning?f_ri=2529"},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529"},{"id":654066,"name":"Theory of Argumentation","url":"https://www.academia.edu/Documents/in/Theory_of_Argumentation?f_ri=2529"},{"id":1524628,"name":"Defeasible Logic","url":"https://www.academia.edu/Documents/in/Defeasible_Logic?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_22701670" data-work_id="22701670" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/22701670/Epistemology_and_artificial_intelligence">Epistemology and artificial intelligence</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/22701670" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5cb6182052ea364c4ff178664e2292be" rel="nofollow" data-download="{"attachment_id":43277872,"asset_id":22701670,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43277872/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="268998" href="https://frankfurt-school.academia.edu/GregoryWheeler">Gregory Wheeler</a><script data-card-contents-for-user="268998" type="text/json">{"id":268998,"first_name":"Gregory","last_name":"Wheeler","domain_name":"frankfurt-school","page_name":"GregoryWheeler","display_name":"Gregory Wheeler","profile_url":"https://frankfurt-school.academia.edu/GregoryWheeler?f_ri=2529","photo":"https://0.academia-photos.com/268998/11779358/13130146/s65_gregory.wheeler.jpg"}</script></span></span></li><li class="js-paper-rank-work_22701670 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="22701670"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 22701670, container: ".js-paper-rank-work_22701670", }); });</script></li><li class="js-percentile-work_22701670 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 22701670; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_22701670"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_22701670 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="22701670"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 22701670; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=22701670]").text(description); $(".js-view-count-work_22701670").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_22701670").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="22701670"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19997" href="https://www.academia.edu/Documents/in/Pure_Mathematics">Pure Mathematics</a>, <script data-card-contents-for-ri="19997" type="text/json">{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22615" href="https://www.academia.edu/Documents/in/Knowledge_Representation">Knowledge Representation</a><script data-card-contents-for-ri="22615" type="text/json">{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=22701670]'), work: {"id":22701670,"title":"Epistemology and artificial intelligence","created_at":"2016-03-02T11:52:28.604-08:00","url":"https://www.academia.edu/22701670/Epistemology_and_artificial_intelligence?f_ri=2529","dom_id":"work_22701670","summary":null,"downloadable_attachments":[{"id":43277872,"asset_id":22701670,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":268998,"first_name":"Gregory","last_name":"Wheeler","domain_name":"frankfurt-school","page_name":"GregoryWheeler","display_name":"Gregory Wheeler","profile_url":"https://frankfurt-school.academia.edu/GregoryWheeler?f_ri=2529","photo":"https://0.academia-photos.com/268998/11779358/13130146/s65_gregory.wheeler.jpg"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics?f_ri=2529","nofollow":false},{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529","nofollow":false},{"id":61603,"name":"Uncertainty","url":"https://www.academia.edu/Documents/in/Uncertainty?f_ri=2529"},{"id":110961,"name":"Applied Logic","url":"https://www.academia.edu/Documents/in/Applied_Logic?f_ri=2529"},{"id":239810,"name":"Field Study","url":"https://www.academia.edu/Documents/in/Field_Study?f_ri=2529"},{"id":635138,"name":"Default Logic","url":"https://www.academia.edu/Documents/in/Default_Logic?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_26627406" data-work_id="26627406" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/26627406/Utilizaci%C3%B3n_de_acertijos_l%C3%B3gicos_como_ejercicios_motivadores_para_la_ense%C3%B1anza_de_la_programaci%C3%B3n_l%C3%B3gica">Utilización de acertijos lógicos como ejercicios motivadores para la enseñanza de la programación lógica</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/26627406" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c395cd694f433993f2d94d5bbf4d96b3" rel="nofollow" data-download="{"attachment_id":46912598,"asset_id":26627406,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46912598/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3755735" href="https://unicen.academia.edu/DanielaGodoy">Daniela Godoy</a><script data-card-contents-for-user="3755735" type="text/json">{"id":3755735,"first_name":"Daniela","last_name":"Godoy","domain_name":"unicen","page_name":"DanielaGodoy","display_name":"Daniela Godoy","profile_url":"https://unicen.academia.edu/DanielaGodoy?f_ri=2529","photo":"https://0.academia-photos.com/3755735/19716558/19572902/s65_daniela.godoy.jpg"}</script></span></span></li><li class="js-paper-rank-work_26627406 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="26627406"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 26627406, container: ".js-paper-rank-work_26627406", }); });</script></li><li class="js-percentile-work_26627406 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 26627406; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_26627406"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_26627406 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="26627406"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 26627406; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=26627406]").text(description); $(".js-view-count-work_26627406").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_26627406").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="26627406"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i></div><span class="InlineList-item-text u-textTruncate u-pl6x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (false) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=26627406]'), work: {"id":26627406,"title":"Utilización de acertijos lógicos como ejercicios motivadores para la enseñanza de la programación lógica","created_at":"2016-06-30T04:54:42.030-07:00","url":"https://www.academia.edu/26627406/Utilizaci%C3%B3n_de_acertijos_l%C3%B3gicos_como_ejercicios_motivadores_para_la_ense%C3%B1anza_de_la_programaci%C3%B3n_l%C3%B3gica?f_ri=2529","dom_id":"work_26627406","summary":null,"downloadable_attachments":[{"id":46912598,"asset_id":26627406,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3755735,"first_name":"Daniela","last_name":"Godoy","domain_name":"unicen","page_name":"DanielaGodoy","display_name":"Daniela Godoy","profile_url":"https://unicen.academia.edu/DanielaGodoy?f_ri=2529","photo":"https://0.academia-photos.com/3755735/19716558/19572902/s65_daniela.godoy.jpg"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_40609414" data-work_id="40609414" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/40609414/A_Personal_Formal_Methods_Archive">A Personal Formal Methods Archive</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">A personal archive of material related to formal methods has been deposited at Swansea University by the author in 2018. This paper documents the contents of the archive and includes associated publications. The archival material forms... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_40609414" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">A personal archive of material related to formal methods has been deposited at Swansea University by the author in 2018. This paper documents the contents of the archive and includes associated publications. The archival material forms part of a larger History of Computing Collection founded by Prof. John Tucker at Swansea in 2007 and held at the University. It is hoped that this paper can aid future archivists with placing the material in context.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/40609414" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6cefedf4c7421e9d8172afe12a2e985f" rel="nofollow" data-download="{"attachment_id":60888123,"asset_id":40609414,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/60888123/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=2529","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_40609414 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="40609414"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 40609414, container: ".js-paper-rank-work_40609414", }); });</script></li><li class="js-percentile-work_40609414 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 40609414; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_40609414"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_40609414 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="40609414"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 40609414; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=40609414]").text(description); $(".js-view-count-work_40609414").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_40609414").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="40609414"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">20</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="445" href="https://www.academia.edu/Documents/in/Computer_Graphics">Computer Graphics</a>, <script data-card-contents-for-ri="445" type="text/json">{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="450" href="https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_">Formal Methods (Formal Verification)</a><script data-card-contents-for-ri="450" type="text/json">{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=40609414]'), work: {"id":40609414,"title":"A Personal Formal Methods Archive","created_at":"2019-10-13T10:33:42.250-07:00","url":"https://www.academia.edu/40609414/A_Personal_Formal_Methods_Archive?f_ri=2529","dom_id":"work_40609414","summary":"A personal archive of material related to formal methods has been deposited at Swansea University by the author in 2018. This paper documents the contents of the archive and includes associated publications. The archival material forms part of a larger History of Computing Collection founded by Prof. John Tucker at Swansea in 2007 and held at the University. It is hoped that this paper can aid future archivists with placing the material in context.\n","downloadable_attachments":[{"id":60888123,"asset_id":40609414,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=2529","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":445,"name":"Computer Graphics","url":"https://www.academia.edu/Documents/in/Computer_Graphics?f_ri=2529","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false},{"id":450,"name":"Formal Methods (Formal Verification)","url":"https://www.academia.edu/Documents/in/Formal_Methods_Formal_Verification_?f_ri=2529","nofollow":false},{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=2529"},{"id":472,"name":"Human Computer Interaction","url":"https://www.academia.edu/Documents/in/Human_Computer_Interaction?f_ri=2529"},{"id":495,"name":"History Of Computing","url":"https://www.academia.edu/Documents/in/History_Of_Computing?f_ri=2529"},{"id":2084,"name":"History of Mathematics","url":"https://www.academia.edu/Documents/in/History_of_Mathematics?f_ri=2529"},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":3723,"name":"History of Science","url":"https://www.academia.edu/Documents/in/History_of_Science?f_ri=2529"},{"id":14681,"name":"Formal methods","url":"https://www.academia.edu/Documents/in/Formal_methods?f_ri=2529"},{"id":39572,"name":"History of Computing (Computer Science)","url":"https://www.academia.edu/Documents/in/History_of_Computing_Computer_Science_?f_ri=2529"},{"id":49800,"name":"Alan Turing","url":"https://www.academia.edu/Documents/in/Alan_Turing?f_ri=2529"},{"id":71155,"name":"History of Computer Sciences","url":"https://www.academia.edu/Documents/in/History_of_Computer_Sciences?f_ri=2529"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=2529"},{"id":130836,"name":"Z Notation","url":"https://www.academia.edu/Documents/in/Z_Notation?f_ri=2529"},{"id":172035,"name":"Formal Verification","url":"https://www.academia.edu/Documents/in/Formal_Verification?f_ri=2529"},{"id":231369,"name":"Compilers and Programming Languages","url":"https://www.academia.edu/Documents/in/Compilers_and_Programming_Languages?f_ri=2529"},{"id":236340,"name":"Formal methods (Z notation)","url":"https://www.academia.edu/Documents/in/Formal_methods_Z_notation_?f_ri=2529"},{"id":316093,"name":"Software Requirement Specification","url":"https://www.academia.edu/Documents/in/Software_Requirement_Specification?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_22950550" data-work_id="22950550" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/22950550/Extending_movilog_for_supporting_Web_services">Extending movilog for supporting Web services</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/22950550" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b936275ebcbc667a46e8b8db50faa956" rel="nofollow" data-download="{"attachment_id":43473177,"asset_id":22950550,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43473177/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="44551207" href="https://independent.academia.edu/CampoMarcelo">Marcelo Campo</a><script data-card-contents-for-user="44551207" type="text/json">{"id":44551207,"first_name":"Marcelo","last_name":"Campo","domain_name":"independent","page_name":"CampoMarcelo","display_name":"Marcelo Campo","profile_url":"https://independent.academia.edu/CampoMarcelo?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_22950550 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="22950550"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 22950550, container: ".js-paper-rank-work_22950550", }); });</script></li><li class="js-percentile-work_22950550 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 22950550; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_22950550"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_22950550 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="22950550"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 22950550; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=22950550]").text(description); $(".js-view-count-work_22950550").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_22950550").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="22950550"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7638" href="https://www.academia.edu/Documents/in/Web_Accessibility">Web Accessibility</a>, <script data-card-contents-for-ri="7638" type="text/json">{"id":7638,"name":"Web Accessibility","url":"https://www.academia.edu/Documents/in/Web_Accessibility?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9545" href="https://www.academia.edu/Documents/in/Web_Services">Web Services</a><script data-card-contents-for-ri="9545" type="text/json">{"id":9545,"name":"Web Services","url":"https://www.academia.edu/Documents/in/Web_Services?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=22950550]'), work: {"id":22950550,"title":"Extending movilog for supporting Web services","created_at":"2016-03-07T13:33:58.356-08:00","url":"https://www.academia.edu/22950550/Extending_movilog_for_supporting_Web_services?f_ri=2529","dom_id":"work_22950550","summary":null,"downloadable_attachments":[{"id":43473177,"asset_id":22950550,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":44551207,"first_name":"Marcelo","last_name":"Campo","domain_name":"independent","page_name":"CampoMarcelo","display_name":"Marcelo Campo","profile_url":"https://independent.academia.edu/CampoMarcelo?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":7638,"name":"Web Accessibility","url":"https://www.academia.edu/Documents/in/Web_Accessibility?f_ri=2529","nofollow":false},{"id":9545,"name":"Web Services","url":"https://www.academia.edu/Documents/in/Web_Services?f_ri=2529","nofollow":false},{"id":27223,"name":"Intelligent Agents","url":"https://www.academia.edu/Documents/in/Intelligent_Agents?f_ri=2529"},{"id":45872,"name":"Intelligent Agent","url":"https://www.academia.edu/Documents/in/Intelligent_Agent?f_ri=2529"},{"id":64561,"name":"Computer Software","url":"https://www.academia.edu/Documents/in/Computer_Software?f_ri=2529"},{"id":201165,"name":"Mobile Agents","url":"https://www.academia.edu/Documents/in/Mobile_Agents?f_ri=2529"},{"id":317992,"name":"Web Service","url":"https://www.academia.edu/Documents/in/Web_Service?f_ri=2529"},{"id":381495,"name":"Tool Development","url":"https://www.academia.edu/Documents/in/Tool_Development?f_ri=2529"},{"id":423253,"name":"Mobile Agent","url":"https://www.academia.edu/Documents/in/Mobile_Agent?f_ri=2529"},{"id":1489478,"name":"Programming language","url":"https://www.academia.edu/Documents/in/Programming_language?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_29176711" data-work_id="29176711" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/29176711/What_a_makers_knowledge_could_be">What a maker's knowledge could be</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Three classic distinctions specify that truths can be necessary versus contingent, analytic versus synthetic, and a priori versus a posteriori. The philosopher reading this article knows very well both how useful and ordinary such... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_29176711" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Three classic distinctions specify that truths can be necessary versus contingent, analytic versus synthetic, and a priori versus a posteriori. The philosopher reading this article knows very well both how useful and ordinary such distinctions are in our conceptual work and that they have been subject to many and detailed debates, especially the last two. In the following pages, I do not wish to discuss how far they may be tenable. I shall assume that, if they are reasonable and non problematic in some ordinary cases, then they can be used in order to understand what kind of knowledge the maker's knowledge is. By this I mean the sort of knowledge that Alice enjoys when she holds the information (true content) that Bob's coffee is sweetened because she just put two spoons of sugar in it herself. The maker's knowledge tradition is quite important but it is not mainstream in modern and analytic epistemology and lacks grounding in terms of exactly what sort of knowledge one is talking about. My suggestion is that this grounding can be provided by a minimalist approach, based on an information-theoretical analysis. In the article, I argue that (a) we need to decouple a fourth distinction, namely informative versus uninformative, from the previous three and, in particular, from its implicit association with analytic versus synthetic and a priori versus a posteriori; (b) such a decoupling facilitates, and is facilitated by, moving from a monoagent to a multiagent approach: the distinctions qualify a proposition, a message, or some information not just in themselves but relationally, with respect to an informational agent; (c) the decoupling and the multiagent approach enable a re-mapping of currently available positions in epistemology (Classic, Innatist, Kant's and Kripke's) on these four dichotomies; (d) within such a re-mapping, two positions, capturing the nature of a witness' knowledge and of a maker's knowledge, can best be described as contingent, synthetic, a posteriori, and uninformative and as<br />contingent, synthetic, weakly a priori (ab anteriori), and uninformative respectively. In the conclusion, I indicate why the analysis of the maker’s knowledge has important consequences in all those cases in which the poietic (constructive) intervention on a system determines the truth of the model of that system.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/29176711" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0f2392df2f1ba0b053e11e7ba47b6784" rel="nofollow" data-download="{"attachment_id":49621929,"asset_id":29176711,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49621929/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="6616" href="https://yale.academia.edu/LucianoFloridi">Luciano Floridi</a><script data-card-contents-for-user="6616" type="text/json">{"id":6616,"first_name":"Luciano","last_name":"Floridi","domain_name":"yale","page_name":"LucianoFloridi","display_name":"Luciano Floridi","profile_url":"https://yale.academia.edu/LucianoFloridi?f_ri=2529","photo":"https://0.academia-photos.com/6616/2546/117746817/s65_luciano.floridi.jpg"}</script></span></span></li><li class="js-paper-rank-work_29176711 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="29176711"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 29176711, container: ".js-paper-rank-work_29176711", }); });</script></li><li class="js-percentile-work_29176711 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 29176711; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_29176711"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_29176711 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="29176711"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 29176711; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=29176711]").text(description); $(".js-view-count-work_29176711").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_29176711").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="29176711"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">159</a>  </div><span class="InlineList-item-text u-textTruncate u-pl11x"><a class="InlineList-item-text" data-has-card-for-ri="221" href="https://www.academia.edu/Documents/in/Psychology">Psychology</a>, <script data-card-contents-for-ri="221" type="text/json">{"id":221,"name":"Psychology","url":"https://www.academia.edu/Documents/in/Psychology?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="236" href="https://www.academia.edu/Documents/in/Cognitive_Psychology">Cognitive Psychology</a>, <script data-card-contents-for-ri="236" type="text/json">{"id":236,"name":"Cognitive Psychology","url":"https://www.academia.edu/Documents/in/Cognitive_Psychology?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="360" href="https://www.academia.edu/Documents/in/Logic_And_Foundations_Of_Mathematics">Logic And Foundations Of Mathematics</a><script data-card-contents-for-ri="360" type="text/json">{"id":360,"name":"Logic And Foundations Of Mathematics","url":"https://www.academia.edu/Documents/in/Logic_And_Foundations_Of_Mathematics?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=29176711]'), work: {"id":29176711,"title":"What a maker's knowledge could be","created_at":"2016-10-15T08:49:44.270-07:00","url":"https://www.academia.edu/29176711/What_a_makers_knowledge_could_be?f_ri=2529","dom_id":"work_29176711","summary":"Three classic distinctions specify that truths can be necessary versus contingent, analytic versus synthetic, and a priori versus a posteriori. The philosopher reading this article knows very well both how useful and ordinary such distinctions are in our conceptual work and that they have been subject to many and detailed debates, especially the last two. In the following pages, I do not wish to discuss how far they may be tenable. I shall assume that, if they are reasonable and non problematic in some ordinary cases, then they can be used in order to understand what kind of knowledge the maker's knowledge is. By this I mean the sort of knowledge that Alice enjoys when she holds the information (true content) that Bob's coffee is sweetened because she just put two spoons of sugar in it herself. The maker's knowledge tradition is quite important but it is not mainstream in modern and analytic epistemology and lacks grounding in terms of exactly what sort of knowledge one is talking about. My suggestion is that this grounding can be provided by a minimalist approach, based on an information-theoretical analysis. In the article, I argue that (a) we need to decouple a fourth distinction, namely informative versus uninformative, from the previous three and, in particular, from its implicit association with analytic versus synthetic and a priori versus a posteriori; (b) such a decoupling facilitates, and is facilitated by, moving from a monoagent to a multiagent approach: the distinctions qualify a proposition, a message, or some information not just in themselves but relationally, with respect to an informational agent; (c) the decoupling and the multiagent approach enable a re-mapping of currently available positions in epistemology (Classic, Innatist, Kant's and Kripke's) on these four dichotomies; (d) within such a re-mapping, two positions, capturing the nature of a witness' knowledge and of a maker's knowledge, can best be described as contingent, synthetic, a posteriori, and uninformative and as\ncontingent, synthetic, weakly a priori (ab anteriori), and uninformative respectively. In the conclusion, I indicate why the analysis of the maker’s knowledge has important consequences in all those cases in which the poietic (constructive) intervention on a system determines the truth of the model of that system. ","downloadable_attachments":[{"id":49621929,"asset_id":29176711,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":6616,"first_name":"Luciano","last_name":"Floridi","domain_name":"yale","page_name":"LucianoFloridi","display_name":"Luciano Floridi","profile_url":"https://yale.academia.edu/LucianoFloridi?f_ri=2529","photo":"https://0.academia-photos.com/6616/2546/117746817/s65_luciano.floridi.jpg"}],"research_interests":[{"id":221,"name":"Psychology","url":"https://www.academia.edu/Documents/in/Psychology?f_ri=2529","nofollow":false},{"id":236,"name":"Cognitive Psychology","url":"https://www.academia.edu/Documents/in/Cognitive_Psychology?f_ri=2529","nofollow":false},{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false},{"id":360,"name":"Logic And Foundations Of Mathematics","url":"https://www.academia.edu/Documents/in/Logic_And_Foundations_Of_Mathematics?f_ri=2529","nofollow":false},{"id":361,"name":"Modal Logic","url":"https://www.academia.edu/Documents/in/Modal_Logic?f_ri=2529"},{"id":803,"name":"Philosophy","url":"https://www.academia.edu/Documents/in/Philosophy?f_ri=2529"},{"id":806,"name":"Philosophy of Mind","url":"https://www.academia.edu/Documents/in/Philosophy_of_Mind?f_ri=2529"},{"id":807,"name":"Philosophy Of Language","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Language?f_ri=2529"},{"id":809,"name":"Analytic Philosophy","url":"https://www.academia.edu/Documents/in/Analytic_Philosophy?f_ri=2529"},{"id":811,"name":"Applied Philosophy","url":"https://www.academia.edu/Documents/in/Applied_Philosophy?f_ri=2529"},{"id":813,"name":"Political Philosophy","url":"https://www.academia.edu/Documents/in/Political_Philosophy?f_ri=2529"},{"id":815,"name":"Epistemology","url":"https://www.academia.edu/Documents/in/Epistemology?f_ri=2529"},{"id":817,"name":"Philosophy of Agency","url":"https://www.academia.edu/Documents/in/Philosophy_of_Agency?f_ri=2529"},{"id":818,"name":"Philosophy of Action","url":"https://www.academia.edu/Documents/in/Philosophy_of_Action?f_ri=2529"},{"id":821,"name":"Philosophy of Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Science?f_ri=2529"},{"id":822,"name":"Philosophy of Physics","url":"https://www.academia.edu/Documents/in/Philosophy_of_Physics?f_ri=2529"},{"id":823,"name":"Philosophy of Biology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Biology?f_ri=2529"},{"id":825,"name":"Medieval Philosophy","url":"https://www.academia.edu/Documents/in/Medieval_Philosophy?f_ri=2529"},{"id":849,"name":"Kant","url":"https://www.academia.edu/Documents/in/Kant?f_ri=2529"},{"id":855,"name":"Philosophy of Technology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Technology?f_ri=2529"},{"id":864,"name":"Environmental Philosophy","url":"https://www.academia.edu/Documents/in/Environmental_Philosophy?f_ri=2529"},{"id":865,"name":"Presocratic Philosophy","url":"https://www.academia.edu/Documents/in/Presocratic_Philosophy?f_ri=2529"},{"id":866,"name":"Experimental philosophy","url":"https://www.academia.edu/Documents/in/Experimental_philosophy?f_ri=2529"},{"id":868,"name":"Philosophical Psychology","url":"https://www.academia.edu/Documents/in/Philosophical_Psychology?f_ri=2529"},{"id":902,"name":"Philosophy Of Religion","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Religion?f_ri=2529"},{"id":911,"name":"17th Century \u0026 Early Modern Philosophy","url":"https://www.academia.edu/Documents/in/17th_Century_and_Early_Modern_Philosophy?f_ri=2529"},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529"},{"id":936,"name":"History of Analytic Philosophy","url":"https://www.academia.edu/Documents/in/History_of_Analytic_Philosophy?f_ri=2529"},{"id":968,"name":"Scepticism","url":"https://www.academia.edu/Documents/in/Scepticism?f_ri=2529"},{"id":1020,"name":"Chinese Philosophy","url":"https://www.academia.edu/Documents/in/Chinese_Philosophy?f_ri=2529"},{"id":1021,"name":"Comparative Philosophy","url":"https://www.academia.edu/Documents/in/Comparative_Philosophy?f_ri=2529"},{"id":1200,"name":"Languages and Linguistics","url":"https://www.academia.edu/Documents/in/Languages_and_Linguistics?f_ri=2529"},{"id":1221,"name":"Indian Philosophy","url":"https://www.academia.edu/Documents/in/Indian_Philosophy?f_ri=2529"},{"id":1222,"name":"Buddhist Philosophy","url":"https://www.academia.edu/Documents/in/Buddhist_Philosophy?f_ri=2529"},{"id":1225,"name":"African Philosophy","url":"https://www.academia.edu/Documents/in/African_Philosophy?f_ri=2529"},{"id":1241,"name":"Knowledge Management","url":"https://www.academia.edu/Documents/in/Knowledge_Management?f_ri=2529"},{"id":1441,"name":"Philosophical Anthropology","url":"https://www.academia.edu/Documents/in/Philosophical_Anthropology?f_ri=2529"},{"id":1708,"name":"Philosophical Scepticism","url":"https://www.academia.edu/Documents/in/Philosophical_Scepticism?f_ri=2529"},{"id":2010,"name":"Computational Logic","url":"https://www.academia.edu/Documents/in/Computational_Logic?f_ri=2529"},{"id":2017,"name":"Hellenistic Philosophy","url":"https://www.academia.edu/Documents/in/Hellenistic_Philosophy?f_ri=2529"},{"id":2020,"name":"Neoplatonism and late antique philosophy","url":"https://www.academia.edu/Documents/in/Neoplatonism_and_late_antique_philosophy?f_ri=2529"},{"id":2459,"name":"Social Philosophy","url":"https://www.academia.edu/Documents/in/Social_Philosophy?f_ri=2529"},{"id":2509,"name":"Philosophy Of Mathematics","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Mathematics?f_ri=2529"},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":2559,"name":"Philosophy of Education","url":"https://www.academia.edu/Documents/in/Philosophy_of_Education?f_ri=2529"},{"id":2562,"name":"Philosophical Theology","url":"https://www.academia.edu/Documents/in/Philosophical_Theology?f_ri=2529"},{"id":2993,"name":"Sociology of Knowledge","url":"https://www.academia.edu/Documents/in/Sociology_of_Knowledge?f_ri=2529"},{"id":3405,"name":"Frankfurt School (Philosophy)","url":"https://www.academia.edu/Documents/in/Frankfurt_School_Philosophy_?f_ri=2529"},{"id":3495,"name":"American Philosophy","url":"https://www.academia.edu/Documents/in/American_Philosophy?f_ri=2529"},{"id":3730,"name":"Philosophy of Psychology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Psychology?f_ri=2529"},{"id":3876,"name":"Hobbes","url":"https://www.academia.edu/Documents/in/Hobbes?f_ri=2529"},{"id":3939,"name":"History and Philosophy of Biology","url":"https://www.academia.edu/Documents/in/History_and_Philosophy_of_Biology?f_ri=2529"},{"id":4124,"name":"Feminist Philosophy","url":"https://www.academia.edu/Documents/in/Feminist_Philosophy?f_ri=2529"},{"id":4440,"name":"Philosophy of Medicine","url":"https://www.academia.edu/Documents/in/Philosophy_of_Medicine?f_ri=2529"},{"id":4686,"name":"Renaissance Philosophy","url":"https://www.academia.edu/Documents/in/Renaissance_Philosophy?f_ri=2529"},{"id":5288,"name":"Philosophy of Film","url":"https://www.academia.edu/Documents/in/Philosophy_of_Film?f_ri=2529"},{"id":5289,"name":"Philosophy of Literature","url":"https://www.academia.edu/Documents/in/Philosophy_of_Literature?f_ri=2529"},{"id":5290,"name":"Philosophy of Art","url":"https://www.academia.edu/Documents/in/Philosophy_of_Art?f_ri=2529"},{"id":5674,"name":"Islamic Philosophy","url":"https://www.academia.edu/Documents/in/Islamic_Philosophy?f_ri=2529"},{"id":5703,"name":"History of Philosophy of Science","url":"https://www.academia.edu/Documents/in/History_of_Philosophy_of_Science?f_ri=2529"},{"id":5960,"name":"Continental Philosophy","url":"https://www.academia.edu/Documents/in/Continental_Philosophy?f_ri=2529"},{"id":5972,"name":"History of Logic","url":"https://www.academia.edu/Documents/in/History_of_Logic?f_ri=2529"},{"id":6028,"name":"Kant-studies","url":"https://www.academia.edu/Documents/in/Kant-studies?f_ri=2529"},{"id":6072,"name":"Realism (Philosophy)","url":"https://www.academia.edu/Documents/in/Realism_Philosophy_?f_ri=2529"},{"id":6728,"name":"Philosophy Of Law","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Law?f_ri=2529"},{"id":6784,"name":"Contemporary French Philosophy","url":"https://www.academia.edu/Documents/in/Contemporary_French_Philosophy?f_ri=2529"},{"id":8064,"name":"Giambattista Vico","url":"https://www.academia.edu/Documents/in/Giambattista_Vico?f_ri=2529"},{"id":8235,"name":"Philosophy Of Economics","url":"https://www.academia.edu/Documents/in/Philosophy_Of_Economics?f_ri=2529"},{"id":8282,"name":"Film-Philosophy","url":"https://www.academia.edu/Documents/in/Film-Philosophy?f_ri=2529"},{"id":8291,"name":"Kant's Practical Philosophy","url":"https://www.academia.edu/Documents/in/Kants_Practical_Philosophy?f_ri=2529"},{"id":8546,"name":"Philosophy of Psychiatry","url":"https://www.academia.edu/Documents/in/Philosophy_of_Psychiatry?f_ri=2529"},{"id":9041,"name":"Process Philosophy","url":"https://www.academia.edu/Documents/in/Process_Philosophy?f_ri=2529"},{"id":9213,"name":"Modality","url":"https://www.academia.edu/Documents/in/Modality?f_ri=2529"},{"id":9465,"name":"Philosophy of History","url":"https://www.academia.edu/Documents/in/Philosophy_of_History?f_ri=2529"},{"id":9720,"name":"Philosophy of Music","url":"https://www.academia.edu/Documents/in/Philosophy_of_Music?f_ri=2529"},{"id":10389,"name":"Philosophy of Mathematics Education","url":"https://www.academia.edu/Documents/in/Philosophy_of_Mathematics_Education?f_ri=2529"},{"id":10476,"name":"Francis Bacon","url":"https://www.academia.edu/Documents/in/Francis_Bacon?f_ri=2529"},{"id":10492,"name":"Thomas Hobbes","url":"https://www.academia.edu/Documents/in/Thomas_Hobbes?f_ri=2529"},{"id":10984,"name":"Formal Epistemology","url":"https://www.academia.edu/Documents/in/Formal_Epistemology?f_ri=2529"},{"id":11104,"name":"Philosophical Logic","url":"https://www.academia.edu/Documents/in/Philosophical_Logic?f_ri=2529"},{"id":11162,"name":"Philosophy of Criminal Law","url":"https://www.academia.edu/Documents/in/Philosophy_of_Criminal_Law?f_ri=2529"},{"id":11400,"name":"Philosophy of Social Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Social_Science?f_ri=2529"},{"id":12354,"name":"Epistemic Justification","url":"https://www.academia.edu/Documents/in/Epistemic_Justification?f_ri=2529"},{"id":12424,"name":"Philosophy of Chemistry","url":"https://www.academia.edu/Documents/in/Philosophy_of_Chemistry?f_ri=2529"},{"id":12685,"name":"Epistemic Logic","url":"https://www.academia.edu/Documents/in/Epistemic_Logic?f_ri=2529"},{"id":13031,"name":"Transcendental Philosophy","url":"https://www.academia.edu/Documents/in/Transcendental_Philosophy?f_ri=2529"},{"id":13279,"name":"Philosophy of Logic","url":"https://www.academia.edu/Documents/in/Philosophy_of_Logic?f_ri=2529"},{"id":13634,"name":"Philosophy of Management","url":"https://www.academia.edu/Documents/in/Philosophy_of_Management?f_ri=2529"},{"id":13742,"name":"Logical Constants","url":"https://www.academia.edu/Documents/in/Logical_Constants?f_ri=2529"},{"id":13833,"name":"Social Epistemology","url":"https://www.academia.edu/Documents/in/Social_Epistemology?f_ri=2529"},{"id":13980,"name":"Arabic Philosophy","url":"https://www.academia.edu/Documents/in/Arabic_Philosophy?f_ri=2529"},{"id":14167,"name":"Philosophy of Culture","url":"https://www.academia.edu/Documents/in/Philosophy_of_Culture?f_ri=2529"},{"id":14189,"name":"Philosophy of Sport","url":"https://www.academia.edu/Documents/in/Philosophy_of_Sport?f_ri=2529"},{"id":14191,"name":"Philosophy of Geography","url":"https://www.academia.edu/Documents/in/Philosophy_of_Geography?f_ri=2529"},{"id":14457,"name":"Emmanuel Kant","url":"https://www.academia.edu/Documents/in/Emmanuel_Kant?f_ri=2529"},{"id":14989,"name":"Philosophy of Time","url":"https://www.academia.edu/Documents/in/Philosophy_of_Time?f_ri=2529"},{"id":15180,"name":"Philosophy of Cognitive Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Cognitive_Science?f_ri=2529"},{"id":16031,"name":"Immanuel Kant","url":"https://www.academia.edu/Documents/in/Immanuel_Kant?f_ri=2529"},{"id":17097,"name":"Philosophy of Computer Science","url":"https://www.academia.edu/Documents/in/Philosophy_of_Computer_Science?f_ri=2529"},{"id":17178,"name":"Ancient Philosophy","url":"https://www.academia.edu/Documents/in/Ancient_Philosophy?f_ri=2529"},{"id":17442,"name":"Mathematical Logic","url":"https://www.academia.edu/Documents/in/Mathematical_Logic?f_ri=2529"},{"id":17612,"name":"Educational Philosophy","url":"https://www.academia.edu/Documents/in/Educational_Philosophy?f_ri=2529"},{"id":17627,"name":"Philosophy of Engineering","url":"https://www.academia.edu/Documents/in/Philosophy_of_Engineering?f_ri=2529"},{"id":17728,"name":"Philosophy of perception","url":"https://www.academia.edu/Documents/in/Philosophy_of_perception?f_ri=2529"},{"id":18373,"name":"Moral Philosophy","url":"https://www.academia.edu/Documents/in/Moral_Philosophy?f_ri=2529"},{"id":18575,"name":"Justification and evidence","url":"https://www.academia.edu/Documents/in/Justification_and_evidence?f_ri=2529"},{"id":18900,"name":"Philosophy of Love","url":"https://www.academia.edu/Documents/in/Philosophy_of_Love?f_ri=2529"},{"id":19118,"name":"Pragmatism (Philosophy)","url":"https://www.academia.edu/Documents/in/Pragmatism_Philosophy_?f_ri=2529"},{"id":19430,"name":"Jewish Philosophy","url":"https://www.academia.edu/Documents/in/Jewish_Philosophy?f_ri=2529"},{"id":19773,"name":"Structuralism (Philosophy)","url":"https://www.academia.edu/Documents/in/Structuralism_Philosophy_?f_ri=2529"},{"id":19820,"name":"Literature and Philosophy","url":"https://www.academia.edu/Documents/in/Literature_and_Philosophy-20?f_ri=2529"},{"id":19824,"name":"Christian Philosophy","url":"https://www.academia.edu/Documents/in/Christian_Philosophy?f_ri=2529"},{"id":19940,"name":"History Of Modern Philosophy","url":"https://www.academia.edu/Documents/in/History_Of_Modern_Philosophy?f_ri=2529"},{"id":20715,"name":"Legal Philosophy","url":"https://www.academia.edu/Documents/in/Legal_Philosophy?f_ri=2529"},{"id":20851,"name":"Max Weber (Philosophy)","url":"https://www.academia.edu/Documents/in/Max_Weber_Philosophy_?f_ri=2529"},{"id":21704,"name":"Space and Time (Philosophy)","url":"https://www.academia.edu/Documents/in/Space_and_Time_Philosophy_?f_ri=2529"},{"id":22547,"name":"Social and Political Philosophy","url":"https://www.academia.edu/Documents/in/Social_and_Political_Philosophy?f_ri=2529"},{"id":23367,"name":"Philosophy of Architecture","url":"https://www.academia.edu/Documents/in/Philosophy_of_Architecture?f_ri=2529"},{"id":23519,"name":"19th-century German philosophy","url":"https://www.academia.edu/Documents/in/19th-century_German_philosophy?f_ri=2529"},{"id":23947,"name":"History and Philosophy of the Human Sciences","url":"https://www.academia.edu/Documents/in/History_and_Philosophy_of_the_Human_Sciences?f_ri=2529"},{"id":25198,"name":"Ancient Greek Philosophy","url":"https://www.academia.edu/Documents/in/Ancient_Greek_Philosophy?f_ri=2529"},{"id":25243,"name":"Kant's Political Philosophy","url":"https://www.academia.edu/Documents/in/Kants_Political_Philosophy?f_ri=2529"},{"id":25613,"name":"Philosophy of Nature","url":"https://www.academia.edu/Documents/in/Philosophy_of_Nature?f_ri=2529"},{"id":25729,"name":"Willard Van Orman Quine","url":"https://www.academia.edu/Documents/in/Willard_Van_Orman_Quine?f_ri=2529"},{"id":28039,"name":"Philosophy of Music Education","url":"https://www.academia.edu/Documents/in/Philosophy_of_Music_Education?f_ri=2529"},{"id":28223,"name":"Historical Epistemology","url":"https://www.academia.edu/Documents/in/Historical_Epistemology?f_ri=2529"},{"id":28770,"name":"Modern Political Philosophy","url":"https://www.academia.edu/Documents/in/Modern_Political_Philosophy?f_ri=2529"},{"id":28771,"name":"Contemporary Political Philosophy","url":"https://www.academia.edu/Documents/in/Contemporary_Political_Philosophy?f_ri=2529"},{"id":29710,"name":"Gettier Problem","url":"https://www.academia.edu/Documents/in/Gettier_Problem?f_ri=2529"},{"id":29711,"name":"Skepticism","url":"https://www.academia.edu/Documents/in/Skepticism?f_ri=2529"},{"id":30552,"name":"Islamic Thought \u0026 Philosophy","url":"https://www.academia.edu/Documents/in/Islamic_Thought_and_Philosophy?f_ri=2529"},{"id":31054,"name":"Kant \u0026 neo-Kantianism","url":"https://www.academia.edu/Documents/in/Kant_and_neo-Kantianism?f_ri=2529"},{"id":33324,"name":"Informal Logic","url":"https://www.academia.edu/Documents/in/Informal_Logic?f_ri=2529"},{"id":33855,"name":"Moral and Political Philosophy","url":"https://www.academia.edu/Documents/in/Moral_and_Political_Philosophy?f_ri=2529"},{"id":38040,"name":"Deontic Logic","url":"https://www.academia.edu/Documents/in/Deontic_Logic?f_ri=2529"},{"id":38772,"name":"Early Modern Philosophy","url":"https://www.academia.edu/Documents/in/Early_Modern_Philosophy?f_ri=2529"},{"id":38870,"name":"Contemporary Philosophy","url":"https://www.academia.edu/Documents/in/Contemporary_Philosophy?f_ri=2529"},{"id":41804,"name":"Epistemology of the Social Sciences","url":"https://www.academia.edu/Documents/in/Epistemology_of_the_Social_Sciences?f_ri=2529"},{"id":42816,"name":"Kantian ethics","url":"https://www.academia.edu/Documents/in/Kantian_ethics?f_ri=2529"},{"id":44096,"name":"Knowledge","url":"https://www.academia.edu/Documents/in/Knowledge?f_ri=2529"},{"id":47761,"name":"Saul Kripke","url":"https://www.academia.edu/Documents/in/Saul_Kripke?f_ri=2529"},{"id":51265,"name":"Philosophie","url":"https://www.academia.edu/Documents/in/Philosophie?f_ri=2529"},{"id":60767,"name":"Epistemología","url":"https://www.academia.edu/Documents/in/Epistemolog%C3%ADa?f_ri=2529"},{"id":61251,"name":"Filosofía","url":"https://www.academia.edu/Documents/in/Filosof%C3%ADa?f_ri=2529"},{"id":69946,"name":"Contemporary Continental Philosophy","url":"https://www.academia.edu/Documents/in/Contemporary_Continental_Philosophy?f_ri=2529"},{"id":74262,"name":"Philosophy of Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Philosophy_of_Artificial_Intelligence?f_ri=2529"},{"id":79503,"name":"History of Informal Logic","url":"https://www.academia.edu/Documents/in/History_of_Informal_Logic?f_ri=2529"},{"id":91722,"name":"Philosophy of the Subject","url":"https://www.academia.edu/Documents/in/Philosophy_of_the_Subject?f_ri=2529"},{"id":94565,"name":"Epistemologia","url":"https://www.academia.edu/Documents/in/Epistemologia?f_ri=2529"},{"id":109172,"name":"Epistemology of natural sciences","url":"https://www.academia.edu/Documents/in/Epistemology_of_natural_sciences?f_ri=2529"},{"id":152278,"name":"Lógica","url":"https://www.academia.edu/Documents/in/L%C3%B3gica?f_ri=2529"},{"id":203286,"name":"Kantian Sublime","url":"https://www.academia.edu/Documents/in/Kantian_Sublime?f_ri=2529"},{"id":330311,"name":"Argumentación Razones Razonamiento Lógica","url":"https://www.academia.edu/Documents/in/Argumentacion_Razones_Razonamiento_Logica?f_ri=2529"},{"id":342382,"name":"Syntactic and Semantic Knowledge","url":"https://www.academia.edu/Documents/in/Syntactic_and_Semantic_Knowledge?f_ri=2529"},{"id":375962,"name":"Maker Culture","url":"https://www.academia.edu/Documents/in/Maker_Culture?f_ri=2529"},{"id":620285,"name":"History of Philosophy","url":"https://www.academia.edu/Documents/in/History_of_Philosophy?f_ri=2529"},{"id":931247,"name":"Philosophy and Sociology of Human/animal Relations","url":"https://www.academia.edu/Documents/in/Philosophy_and_Sociology_of_Human_animal_Relations?f_ri=2529"},{"id":978391,"name":"Socio Political Philosophy","url":"https://www.academia.edu/Documents/in/Socio_Political_Philosophy?f_ri=2529"},{"id":1223710,"name":"Muslim philosophy and thought","url":"https://www.academia.edu/Documents/in/Muslim_philosophy_and_thought?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5732273" data-work_id="5732273" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5732273/Theres_a_Prolog_in_your_Scala_">There's a Prolog in your Scala!</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5732273" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="70a33f6659e77cacb7fc3c03975c34c0" rel="nofollow" data-download="{"attachment_id":32768877,"asset_id":5732273,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/32768877/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3102462" href="https://ukma.academia.edu/folone">George Leontiev</a><script data-card-contents-for-user="3102462" type="text/json">{"id":3102462,"first_name":"George","last_name":"Leontiev","domain_name":"ukma","page_name":"folone","display_name":"George Leontiev","profile_url":"https://ukma.academia.edu/folone?f_ri=2529","photo":"https://gravatar.com/avatar/50e7e3f60b3507383d2b327857b66a62?s=65"}</script></span></span></li><li class="js-paper-rank-work_5732273 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5732273"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5732273, container: ".js-paper-rank-work_5732273", }); });</script></li><li class="js-percentile-work_5732273 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5732273; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5732273"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5732273 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5732273"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5732273; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5732273]").text(description); $(".js-view-count-work_5732273").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5732273").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5732273"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="52558" href="https://www.academia.edu/Documents/in/Prolog">Prolog</a>, <script data-card-contents-for-ri="52558" type="text/json">{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="69005" href="https://www.academia.edu/Documents/in/Scala">Scala</a><script data-card-contents-for-ri="69005" type="text/json">{"id":69005,"name":"Scala","url":"https://www.academia.edu/Documents/in/Scala?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5732273]'), work: {"id":5732273,"title":"There's a Prolog in your Scala!","created_at":"2014-01-15T20:37:33.850-08:00","url":"https://www.academia.edu/5732273/Theres_a_Prolog_in_your_Scala_?f_ri=2529","dom_id":"work_5732273","summary":null,"downloadable_attachments":[{"id":32768877,"asset_id":5732273,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3102462,"first_name":"George","last_name":"Leontiev","domain_name":"ukma","page_name":"folone","display_name":"George Leontiev","profile_url":"https://ukma.academia.edu/folone?f_ri=2529","photo":"https://gravatar.com/avatar/50e7e3f60b3507383d2b327857b66a62?s=65"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false},{"id":69005,"name":"Scala","url":"https://www.academia.edu/Documents/in/Scala?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_13871055" data-work_id="13871055" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/13871055/Process_Control_Simulator_using_programmable_controller_technology">Process Control Simulator using programmable controller technology</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/13871055" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e44afa7ad7ec09057b55a8958563932a" rel="nofollow" data-download="{"attachment_id":44856746,"asset_id":13871055,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/44856746/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32954454" href="https://pub.academia.edu/IoanaFagarasan">Ioana Fagarasan</a><script data-card-contents-for-user="32954454" type="text/json">{"id":32954454,"first_name":"Ioana","last_name":"Fagarasan","domain_name":"pub","page_name":"IoanaFagarasan","display_name":"Ioana Fagarasan","profile_url":"https://pub.academia.edu/IoanaFagarasan?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_13871055 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="13871055"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 13871055, container: ".js-paper-rank-work_13871055", }); });</script></li><li class="js-percentile-work_13871055 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 13871055; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_13871055"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_13871055 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="13871055"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 13871055; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=13871055]").text(description); $(".js-view-count-work_13871055").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_13871055").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="13871055"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6540" href="https://www.academia.edu/Documents/in/Process_Control">Process Control</a>, <script data-card-contents-for-ri="6540" type="text/json">{"id":6540,"name":"Process Control","url":"https://www.academia.edu/Documents/in/Process_Control?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36706" href="https://www.academia.edu/Documents/in/Microcontrollers">Microcontrollers</a>, <script data-card-contents-for-ri="36706" type="text/json">{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="48636" href="https://www.academia.edu/Documents/in/Simulation">Simulation</a><script data-card-contents-for-ri="48636" type="text/json">{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=13871055]'), work: {"id":13871055,"title":"Process Control Simulator using programmable controller technology","created_at":"2015-07-10T01:39:53.425-07:00","url":"https://www.academia.edu/13871055/Process_Control_Simulator_using_programmable_controller_technology?f_ri=2529","dom_id":"work_13871055","summary":null,"downloadable_attachments":[{"id":44856746,"asset_id":13871055,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":32954454,"first_name":"Ioana","last_name":"Fagarasan","domain_name":"pub","page_name":"IoanaFagarasan","display_name":"Ioana Fagarasan","profile_url":"https://pub.academia.edu/IoanaFagarasan?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":6540,"name":"Process Control","url":"https://www.academia.edu/Documents/in/Process_Control?f_ri=2529","nofollow":false},{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false},{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=2529","nofollow":false},{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=2529"},{"id":127270,"name":"Microcontroller","url":"https://www.academia.edu/Documents/in/Microcontroller?f_ri=2529"},{"id":179832,"name":"Programmable logic controllers","url":"https://www.academia.edu/Documents/in/Programmable_logic_controllers?f_ri=2529"},{"id":206145,"name":"System Simulation","url":"https://www.academia.edu/Documents/in/System_Simulation?f_ri=2529"},{"id":1931321,"name":"Application Software","url":"https://www.academia.edu/Documents/in/Application_Software?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5211369" data-work_id="5211369" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5211369/Theme_One_Program_User_Guide">Theme One Program • User Guide</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Theme One is a computer program with a dual objective — to perform tasks of inductive and deductive problem-solving that arise in research and to explore the integration of these reasoning types in human and computer information processing.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5211369" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5e8f37c7145141b25ef2464ff754a9eb" rel="nofollow" data-download="{"attachment_id":32397007,"asset_id":5211369,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/32397007/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="1137448" href="https://independent.academia.edu/JonAwbrey">Jon Awbrey</a><script data-card-contents-for-user="1137448" type="text/json">{"id":1137448,"first_name":"Jon","last_name":"Awbrey","domain_name":"independent","page_name":"JonAwbrey","display_name":"Jon Awbrey","profile_url":"https://independent.academia.edu/JonAwbrey?f_ri=2529","photo":"https://gravatar.com/avatar/b083b8bcc50c99781944d57e74903c57?s=65"}</script></span></span></li><li class="js-paper-rank-work_5211369 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5211369"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5211369, container: ".js-paper-rank-work_5211369", }); });</script></li><li class="js-percentile-work_5211369 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5211369; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5211369"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5211369 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5211369"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5211369; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5211369]").text(description); $(".js-view-count-work_5211369").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5211369").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5211369"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">29</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="98" href="https://www.academia.edu/Documents/in/Semiotics">Semiotics</a>, <script data-card-contents-for-ri="98" type="text/json">{"id":98,"name":"Semiotics","url":"https://www.academia.edu/Documents/in/Semiotics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="365" href="https://www.academia.edu/Documents/in/Model_Theory">Model Theory</a>, <script data-card-contents-for-ri="365" type="text/json">{"id":365,"name":"Model Theory","url":"https://www.academia.edu/Documents/in/Model_Theory?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="424" href="https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_">Automata Theory (Formal Languages)</a><script data-card-contents-for-ri="424" type="text/json">{"id":424,"name":"Automata Theory (Formal Languages)","url":"https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5211369]'), work: {"id":5211369,"title":"Theme One Program • User Guide","created_at":"2013-11-24T23:05:04.117-08:00","url":"https://www.academia.edu/5211369/Theme_One_Program_User_Guide?f_ri=2529","dom_id":"work_5211369","summary":"Theme One is a computer program with a dual objective — to perform tasks of inductive and deductive problem-solving that arise in research and to explore the integration of these reasoning types in human and computer information processing.","downloadable_attachments":[{"id":32397007,"asset_id":5211369,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":1137448,"first_name":"Jon","last_name":"Awbrey","domain_name":"independent","page_name":"JonAwbrey","display_name":"Jon Awbrey","profile_url":"https://independent.academia.edu/JonAwbrey?f_ri=2529","photo":"https://gravatar.com/avatar/b083b8bcc50c99781944d57e74903c57?s=65"}],"research_interests":[{"id":98,"name":"Semiotics","url":"https://www.academia.edu/Documents/in/Semiotics?f_ri=2529","nofollow":false},{"id":365,"name":"Model Theory","url":"https://www.academia.edu/Documents/in/Model_Theory?f_ri=2529","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":424,"name":"Automata Theory (Formal Languages)","url":"https://www.academia.edu/Documents/in/Automata_Theory_Formal_Languages_?f_ri=2529","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529"},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529"},{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning?f_ri=2529"},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":4398,"name":"Peirce","url":"https://www.academia.edu/Documents/in/Peirce?f_ri=2529"},{"id":10977,"name":"Intelligent Systems","url":"https://www.academia.edu/Documents/in/Intelligent_Systems?f_ri=2529"},{"id":13110,"name":"Charles S. Peirce","url":"https://www.academia.edu/Documents/in/Charles_S._Peirce?f_ri=2529"},{"id":17874,"name":"Constraint Programming","url":"https://www.academia.edu/Documents/in/Constraint_Programming?f_ri=2529"},{"id":22615,"name":"Knowledge Representation","url":"https://www.academia.edu/Documents/in/Knowledge_Representation?f_ri=2529"},{"id":29345,"name":"Charles Sanders Peirce","url":"https://www.academia.edu/Documents/in/Charles_Sanders_Peirce?f_ri=2529"},{"id":38364,"name":"Peircean Semiotics","url":"https://www.academia.edu/Documents/in/Peircean_Semiotics?f_ri=2529"},{"id":43774,"name":"Learning","url":"https://www.academia.edu/Documents/in/Learning?f_ri=2529"},{"id":53292,"name":"Programming","url":"https://www.academia.edu/Documents/in/Programming?f_ri=2529"},{"id":84209,"name":"C. S. Peirce","url":"https://www.academia.edu/Documents/in/C._S._Peirce?f_ri=2529"},{"id":86845,"name":"Reasoning","url":"https://www.academia.edu/Documents/in/Reasoning?f_ri=2529"},{"id":90093,"name":"Constraint Satisfaction Problems","url":"https://www.academia.edu/Documents/in/Constraint_Satisfaction_Problems?f_ri=2529"},{"id":105900,"name":"Formal languages","url":"https://www.academia.edu/Documents/in/Formal_languages?f_ri=2529"},{"id":108636,"name":"Inquiry","url":"https://www.academia.edu/Documents/in/Inquiry?f_ri=2529"},{"id":166781,"name":"Learning Theory","url":"https://www.academia.edu/Documents/in/Learning_Theory?f_ri=2529"},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529"},{"id":365828,"name":"Inquiry Driven Systems","url":"https://www.academia.edu/Documents/in/Inquiry_Driven_Systems?f_ri=2529"},{"id":367158,"name":"Abduction, Deduction, Induction","url":"https://www.academia.edu/Documents/in/Abduction_Deduction_Induction?f_ri=2529"},{"id":368005,"name":"Propositional Calculus","url":"https://www.academia.edu/Documents/in/Propositional_Calculus?f_ri=2529"},{"id":477017,"name":"Turbo Pascal","url":"https://www.academia.edu/Documents/in/Turbo_Pascal?f_ri=2529"},{"id":956013,"name":"Logic of Inquiry","url":"https://www.academia.edu/Documents/in/Logic_of_Inquiry?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3400381" data-work_id="3400381" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3400381/A_variable_threshold_voltage_inverter_for_CMOS_programmable_logic_circuits">A variable threshold voltage inverter for CMOS programmable logic circuits</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3400381" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a64088db22eb23c91256ae8621835f5b" rel="nofollow" data-download="{"attachment_id":31186978,"asset_id":3400381,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31186978/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3958116" href="https://independent.academia.edu/Nedelcu">Stefan Nedelcu</a><script data-card-contents-for-user="3958116" type="text/json">{"id":3958116,"first_name":"Stefan","last_name":"Nedelcu","domain_name":"independent","page_name":"Nedelcu","display_name":"Stefan Nedelcu","profile_url":"https://independent.academia.edu/Nedelcu?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3400381 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3400381"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3400381, container: ".js-paper-rank-work_3400381", }); });</script></li><li class="js-percentile-work_3400381 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3400381; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3400381"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3400381 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3400381"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3400381; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3400381]").text(description); $(".js-view-count-work_3400381").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3400381").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3400381"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="36706" href="https://www.academia.edu/Documents/in/Microcontrollers">Microcontrollers</a>, <script data-card-contents-for-ri="36706" type="text/json">{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="609191" href="https://www.academia.edu/Documents/in/Logic_Design">Logic Design</a>, <script data-card-contents-for-ri="609191" type="text/json">{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="628286" href="https://www.academia.edu/Documents/in/Logic_Gates">Logic Gates</a><script data-card-contents-for-ri="628286" type="text/json">{"id":628286,"name":"Logic Gates","url":"https://www.academia.edu/Documents/in/Logic_Gates?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3400381]'), work: {"id":3400381,"title":"A variable threshold voltage inverter for CMOS programmable logic circuits","created_at":"2013-04-27T01:20:43.699-07:00","url":"https://www.academia.edu/3400381/A_variable_threshold_voltage_inverter_for_CMOS_programmable_logic_circuits?f_ri=2529","dom_id":"work_3400381","summary":null,"downloadable_attachments":[{"id":31186978,"asset_id":3400381,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3958116,"first_name":"Stefan","last_name":"Nedelcu","domain_name":"independent","page_name":"Nedelcu","display_name":"Stefan Nedelcu","profile_url":"https://independent.academia.edu/Nedelcu?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":36706,"name":"Microcontrollers","url":"https://www.academia.edu/Documents/in/Microcontrollers?f_ri=2529","nofollow":false},{"id":609191,"name":"Logic Design","url":"https://www.academia.edu/Documents/in/Logic_Design?f_ri=2529","nofollow":false},{"id":628286,"name":"Logic Gates","url":"https://www.academia.edu/Documents/in/Logic_Gates?f_ri=2529","nofollow":false},{"id":739245,"name":"Double Gate","url":"https://www.academia.edu/Documents/in/Double_Gate?f_ri=2529"},{"id":851962,"name":"Programmable Logic","url":"https://www.academia.edu/Documents/in/Programmable_Logic?f_ri=2529"},{"id":968856,"name":"Programmable Logic Devices","url":"https://www.academia.edu/Documents/in/Programmable_Logic_Devices?f_ri=2529"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=2529"},{"id":2039711,"name":"Logic circuits","url":"https://www.academia.edu/Documents/in/Logic_circuits?f_ri=2529"},{"id":2240546,"name":"Integrated Circuit Design","url":"https://www.academia.edu/Documents/in/Integrated_Circuit_Design?f_ri=2529"},{"id":2255138,"name":"Threshold Voltage","url":"https://www.academia.edu/Documents/in/Threshold_Voltage?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27881534" data-work_id="27881534" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27881534/Answer_Set_Solving_in_Practice">Answer Set Solving in Practice</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27881534" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="4a0691b8d85018e37448712998216e79" rel="nofollow" data-download="{"attachment_id":48168082,"asset_id":27881534,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48168082/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="52242156" href="https://independent.academia.edu/KaufmannBenjamin">Benjamin Kaufmann</a><script data-card-contents-for-user="52242156" type="text/json">{"id":52242156,"first_name":"Benjamin","last_name":"Kaufmann","domain_name":"independent","page_name":"KaufmannBenjamin","display_name":"Benjamin Kaufmann","profile_url":"https://independent.academia.edu/KaufmannBenjamin?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_27881534 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27881534"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27881534, container: ".js-paper-rank-work_27881534", }); });</script></li><li class="js-percentile-work_27881534 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27881534; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27881534"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27881534 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27881534"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27881534; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27881534]").text(description); $(".js-view-count-work_27881534").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27881534").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27881534"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="84584" href="https://www.academia.edu/Documents/in/Answer_Set_Programming">Answer Set Programming</a><script data-card-contents-for-ri="84584" type="text/json">{"id":84584,"name":"Answer Set Programming","url":"https://www.academia.edu/Documents/in/Answer_Set_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27881534]'), work: {"id":27881534,"title":"Answer Set Solving in Practice","created_at":"2016-08-19T00:51:44.201-07:00","url":"https://www.academia.edu/27881534/Answer_Set_Solving_in_Practice?f_ri=2529","dom_id":"work_27881534","summary":null,"downloadable_attachments":[{"id":48168082,"asset_id":27881534,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":52242156,"first_name":"Benjamin","last_name":"Kaufmann","domain_name":"independent","page_name":"KaufmannBenjamin","display_name":"Benjamin Kaufmann","profile_url":"https://independent.academia.edu/KaufmannBenjamin?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":84584,"name":"Answer Set Programming","url":"https://www.academia.edu/Documents/in/Answer_Set_Programming?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_2910010" data-work_id="2910010" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/2910010/Decompilation">Decompilation</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">"The Dictionary of Computing gives the following (abridged) defi nitions for a compiler and decompiler (or reverse compiler): compiler A program that translates high-level language into absolute code . . . decompiler A program that... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_2910010" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">"The Dictionary of Computing gives the following (abridged) definitions for a compiler and decompiler (or reverse compiler): <br /> <br />compiler A program that translates high-level language into absolute code . . . <br /> <br />decompiler A program that attempts to . . . translate back from machine code to something resembling the source language. The task is difficult and not often attempted. <br /> <br />The following sections are intended to show how a decompiler may be constructed given only a knowledge of or access to the specification for a forward compiler, and some facility with Prolog or other high-level languages. It is easy to do and <br />should be attempted more often. <br /> <br />Decompilation is only useful, of course, if the object code is available and it is <br />required to reproduce the higher level `original' as an intermediate stage to aid understanding <br />or restructuring. The decompiled code can then be abstracted to a specification <br />by other techniques developed by the REDO project,"</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/2910010" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3ac7881c75ccf5c98164e3ec4c72d637" rel="nofollow" data-download="{"attachment_id":30834778,"asset_id":2910010,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/30834778/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="12280" href="https://lsbu.academia.edu/JonathanBowen">Jonathan Bowen</a><script data-card-contents-for-user="12280" type="text/json">{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=2529","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}</script></span></span></li><li class="js-paper-rank-work_2910010 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="2910010"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 2910010, container: ".js-paper-rank-work_2910010", }); });</script></li><li class="js-percentile-work_2910010 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 2910010; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_2910010"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_2910010 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="2910010"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 2910010; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=2910010]").text(description); $(".js-view-count-work_2910010").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_2910010").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="2910010"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">9</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="457" href="https://www.academia.edu/Documents/in/Compilers">Compilers</a>, <script data-card-contents-for-ri="457" type="text/json">{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1450" href="https://www.academia.edu/Documents/in/Software_Maintenance">Software Maintenance</a><script data-card-contents-for-ri="1450" type="text/json">{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=2910010]'), work: {"id":2910010,"title":"Decompilation","created_at":"2013-03-05T05:04:02.741-08:00","url":"https://www.academia.edu/2910010/Decompilation?f_ri=2529","dom_id":"work_2910010","summary":"\"The Dictionary of Computing gives the following (abridged) defi\fnitions for a compiler and decompiler (or reverse compiler):\r\n\r\ncompiler A program that translates high-level language into absolute code . . .\r\n\r\ndecompiler A program that attempts to . . . translate back from machine code to something resembling the source language. The task is diffi\u000ecult and not often attempted.\r\n\r\nThe following sections are intended to show how a decompiler may be constructed given only a knowledge of or access to the speci\ffication for a forward compiler, and some facility with Prolog or other high-level languages. It is easy to do and\r\nshould be attempted more often.\r\n\r\nDecompilation is only useful, of course, if the object code is available and it is\r\nrequired to reproduce the higher level `original' as an intermediate stage to aid understanding\r\nor restructuring. The decompiled code can then be abstracted to a speci\ffication\r\nby other techniques developed by the REDO project,\"","downloadable_attachments":[{"id":30834778,"asset_id":2910010,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":12280,"first_name":"Jonathan","last_name":"Bowen","domain_name":"lsbu","page_name":"JonathanBowen","display_name":"Jonathan Bowen","profile_url":"https://lsbu.academia.edu/JonathanBowen?f_ri=2529","photo":"https://0.academia-photos.com/12280/4094/29052679/s65_jonathan.bowen.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=2529","nofollow":false},{"id":457,"name":"Compilers","url":"https://www.academia.edu/Documents/in/Compilers?f_ri=2529","nofollow":false},{"id":1450,"name":"Software Maintenance","url":"https://www.academia.edu/Documents/in/Software_Maintenance?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":31379,"name":"Reverse Engineering","url":"https://www.academia.edu/Documents/in/Reverse_Engineering?f_ri=2529"},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529"},{"id":190729,"name":"Decompilation","url":"https://www.academia.edu/Documents/in/Decompilation?f_ri=2529"},{"id":192342,"name":"Reverse Engineering Software","url":"https://www.academia.edu/Documents/in/Reverse_Engineering_Software?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_21846566" data-work_id="21846566" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/21846566/Reengineering_of_IEC_61131_into_IEC_61499_Function_Blocks">Reengineering of IEC 61131 into IEC 61499 Function Blocks</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/21846566" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e4be2ff3581835f57956db2ca3593e72" rel="nofollow" data-download="{"attachment_id":42590669,"asset_id":21846566,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/42590669/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="43073769" href="https://independent.academia.edu/ZoranSalcic">Zoran Salcic</a><script data-card-contents-for-user="43073769" type="text/json">{"id":43073769,"first_name":"Zoran","last_name":"Salcic","domain_name":"independent","page_name":"ZoranSalcic","display_name":"Zoran Salcic","profile_url":"https://independent.academia.edu/ZoranSalcic?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_21846566 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="21846566"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 21846566, container: ".js-paper-rank-work_21846566", }); });</script></li><li class="js-percentile-work_21846566 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 21846566; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_21846566"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_21846566 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="21846566"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 21846566; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=21846566]").text(description); $(".js-view-count-work_21846566").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_21846566").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="21846566"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">14</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="12428" href="https://www.academia.edu/Documents/in/Automatic_Control">Automatic Control</a>, <script data-card-contents-for-ri="12428" type="text/json">{"id":12428,"name":"Automatic Control","url":"https://www.academia.edu/Documents/in/Automatic_Control?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="13550" href="https://www.academia.edu/Documents/in/Industrial_Automation">Industrial Automation</a>, <script data-card-contents-for-ri="13550" type="text/json">{"id":13550,"name":"Industrial Automation","url":"https://www.academia.edu/Documents/in/Industrial_Automation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14604" href="https://www.academia.edu/Documents/in/Flow_Control">Flow Control</a><script data-card-contents-for-ri="14604" type="text/json">{"id":14604,"name":"Flow Control","url":"https://www.academia.edu/Documents/in/Flow_Control?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=21846566]'), work: {"id":21846566,"title":"Reengineering of IEC 61131 into IEC 61499 Function Blocks","created_at":"2016-02-11T13:23:45.675-08:00","url":"https://www.academia.edu/21846566/Reengineering_of_IEC_61131_into_IEC_61499_Function_Blocks?f_ri=2529","dom_id":"work_21846566","summary":null,"downloadable_attachments":[{"id":42590669,"asset_id":21846566,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":43073769,"first_name":"Zoran","last_name":"Salcic","domain_name":"independent","page_name":"ZoranSalcic","display_name":"Zoran Salcic","profile_url":"https://independent.academia.edu/ZoranSalcic?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":12428,"name":"Automatic Control","url":"https://www.academia.edu/Documents/in/Automatic_Control?f_ri=2529","nofollow":false},{"id":13550,"name":"Industrial Automation","url":"https://www.academia.edu/Documents/in/Industrial_Automation?f_ri=2529","nofollow":false},{"id":14604,"name":"Flow Control","url":"https://www.academia.edu/Documents/in/Flow_Control?f_ri=2529","nofollow":false},{"id":31379,"name":"Reverse Engineering","url":"https://www.academia.edu/Documents/in/Reverse_Engineering?f_ri=2529"},{"id":91936,"name":"Hardware","url":"https://www.academia.edu/Documents/in/Hardware?f_ri=2529"},{"id":96628,"name":"Formal Specification","url":"https://www.academia.edu/Documents/in/Formal_Specification?f_ri=2529"},{"id":98569,"name":"Computer Languages","url":"https://www.academia.edu/Documents/in/Computer_Languages?f_ri=2529"},{"id":409792,"name":"Object-oriented languages","url":"https://www.academia.edu/Documents/in/Object-oriented_languages?f_ri=2529"},{"id":582043,"name":"Development Process","url":"https://www.academia.edu/Documents/in/Development_Process?f_ri=2529"},{"id":1121048,"name":"Object Oriented","url":"https://www.academia.edu/Documents/in/Object_Oriented?f_ri=2529"},{"id":1489478,"name":"Programming language","url":"https://www.academia.edu/Documents/in/Programming_language?f_ri=2529"},{"id":1547415,"name":"Data Type","url":"https://www.academia.edu/Documents/in/Data_Type?f_ri=2529"},{"id":1558305,"name":"Function Block","url":"https://www.academia.edu/Documents/in/Function_Block?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_583551" data-work_id="583551" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/583551/Applying_ASP_to_UML_Model_Validation">Applying ASP to UML Model Validation</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/583551" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="36b4219b17b5f531abd024386a48be8d" rel="nofollow" data-download="{"attachment_id":3029651,"asset_id":583551,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/3029651/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="156874" href="https://unimi.academia.edu/AlbertoMomigliano">Alberto Momigliano</a><script data-card-contents-for-user="156874" type="text/json">{"id":156874,"first_name":"Alberto","last_name":"Momigliano","domain_name":"unimi","page_name":"AlbertoMomigliano","display_name":"Alberto Momigliano","profile_url":"https://unimi.academia.edu/AlbertoMomigliano?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_583551 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="583551"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 583551, container: ".js-paper-rank-work_583551", }); });</script></li><li class="js-percentile-work_583551 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 583551; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_583551"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_583551 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="583551"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 583551; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=583551]").text(description); $(".js-view-count-work_583551").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_583551").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="583551"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">4</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="61120" href="https://www.academia.edu/Documents/in/Model_validation">Model validation</a>, <script data-card-contents-for-ri="61120" type="text/json">{"id":61120,"name":"Model validation","url":"https://www.academia.edu/Documents/in/Model_validation?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="208862" href="https://www.academia.edu/Documents/in/UML_Class_Diagram">UML Class Diagram</a>, <script data-card-contents-for-ri="208862" type="text/json">{"id":208862,"name":"UML Class Diagram","url":"https://www.academia.edu/Documents/in/UML_Class_Diagram?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="994520" href="https://www.academia.edu/Documents/in/Design_and_Implementation">Design and Implementation</a><script data-card-contents-for-ri="994520" type="text/json">{"id":994520,"name":"Design and Implementation","url":"https://www.academia.edu/Documents/in/Design_and_Implementation?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=583551]'), work: {"id":583551,"title":"Applying ASP to UML Model Validation","created_at":"2011-05-12T02:10:41.697-07:00","url":"https://www.academia.edu/583551/Applying_ASP_to_UML_Model_Validation?f_ri=2529","dom_id":"work_583551","summary":null,"downloadable_attachments":[{"id":3029651,"asset_id":583551,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":156874,"first_name":"Alberto","last_name":"Momigliano","domain_name":"unimi","page_name":"AlbertoMomigliano","display_name":"Alberto Momigliano","profile_url":"https://unimi.academia.edu/AlbertoMomigliano?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":61120,"name":"Model validation","url":"https://www.academia.edu/Documents/in/Model_validation?f_ri=2529","nofollow":false},{"id":208862,"name":"UML Class Diagram","url":"https://www.academia.edu/Documents/in/UML_Class_Diagram?f_ri=2529","nofollow":false},{"id":994520,"name":"Design and Implementation","url":"https://www.academia.edu/Documents/in/Design_and_Implementation?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3142608" data-work_id="3142608" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3142608/A_Perspective_on_Combining_Different_Programming_Paradigms">A Perspective on Combining Different Programming Paradigms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3142608" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f3f10aa73c820392163ac78ff1a2366e" rel="nofollow" data-download="{"attachment_id":31050786,"asset_id":3142608,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31050786/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="572739" href="https://novisaddepartmentofmathematicsandinformatics.academia.edu/LjubomirJerinic">Ljubomir Jerinic</a><script data-card-contents-for-user="572739" type="text/json">{"id":572739,"first_name":"Ljubomir","last_name":"Jerinic","domain_name":"novisaddepartmentofmathematicsandinformatics","page_name":"LjubomirJerinic","display_name":"Ljubomir Jerinic","profile_url":"https://novisaddepartmentofmathematicsandinformatics.academia.edu/LjubomirJerinic?f_ri=2529","photo":"https://0.academia-photos.com/572739/204311/238412/s65_ljubomir.jerinic.jpg"}</script></span></span></li><li class="js-paper-rank-work_3142608 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3142608"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3142608, container: ".js-paper-rank-work_3142608", }); });</script></li><li class="js-percentile-work_3142608 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3142608; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3142608"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3142608 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3142608"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3142608; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3142608]").text(description); $(".js-view-count-work_3142608").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3142608").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3142608"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">7</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="451" href="https://www.academia.edu/Documents/in/Programming_Languages">Programming Languages</a>, <script data-card-contents-for-ri="451" type="text/json">{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="452" href="https://www.academia.edu/Documents/in/Programming_Paradigms">Programming Paradigms</a>, <script data-card-contents-for-ri="452" type="text/json">{"id":452,"name":"Programming Paradigms","url":"https://www.academia.edu/Documents/in/Programming_Paradigms?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="454" href="https://www.academia.edu/Documents/in/Functional_Programming">Functional Programming</a><script data-card-contents-for-ri="454" type="text/json">{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3142608]'), work: {"id":3142608,"title":"A Perspective on Combining Different Programming Paradigms","created_at":"2013-03-28T09:01:12.675-07:00","url":"https://www.academia.edu/3142608/A_Perspective_on_Combining_Different_Programming_Paradigms?f_ri=2529","dom_id":"work_3142608","summary":null,"downloadable_attachments":[{"id":31050786,"asset_id":3142608,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":572739,"first_name":"Ljubomir","last_name":"Jerinic","domain_name":"novisaddepartmentofmathematicsandinformatics","page_name":"LjubomirJerinic","display_name":"Ljubomir Jerinic","profile_url":"https://novisaddepartmentofmathematicsandinformatics.academia.edu/LjubomirJerinic?f_ri=2529","photo":"https://0.academia-photos.com/572739/204311/238412/s65_ljubomir.jerinic.jpg"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":451,"name":"Programming Languages","url":"https://www.academia.edu/Documents/in/Programming_Languages?f_ri=2529","nofollow":false},{"id":452,"name":"Programming Paradigms","url":"https://www.academia.edu/Documents/in/Programming_Paradigms?f_ri=2529","nofollow":false},{"id":454,"name":"Functional Programming","url":"https://www.academia.edu/Documents/in/Functional_Programming?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529"},{"id":55036,"name":"LISP","url":"https://www.academia.edu/Documents/in/LISP?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1045227" data-work_id="1045227" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1045227/Evolution_prospection_in_decision_making">Evolution prospection in decision making</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This work concerns the problem of modelling evolving prospective agent systems. Inasmuch a prospective agent [1] looks ahead a number of steps into the future, it is confronted with the problem of having several different possible courses... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_1045227" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This work concerns the problem of modelling evolving prospective agent systems. Inasmuch a prospective agent [1] looks ahead a number of steps into the future, it is confronted with the problem of having several different possible courses of evolution, and therefore needs to be able to prefer amongst them to decide the best to follow as seen from its present state. First it needs a priori preferences for the generation of likely courses of evolution. Subsequently, this being one main contribution of this paper, based on the historical information as well as on a mixture of quantitative and qualitative a posteriori evaluation of its possible evolutions, we equip our agent with so-called evolution-level preferences mechanism, involving three distinct types of commitment. In addition, one other main contribution, to enable such a prospective agent to evolve, we provide a way for modelling its evolving knowledge base, including environment and course of evolution triggering of all active goals (desires), context-sensitive preferences and integrity constraints. We exhibit several examples to illustrate the proposed concepts.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1045227" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3da05714bfc73555136c483ab4d47fbe" rel="nofollow" data-download="{"attachment_id":6864334,"asset_id":1045227,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/6864334/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="883505" href="https://tees.academia.edu/TheAnhHan">The Anh Han</a><script data-card-contents-for-user="883505" type="text/json">{"id":883505,"first_name":"The Anh","last_name":"Han","domain_name":"tees","page_name":"TheAnhHan","display_name":"The Anh Han","profile_url":"https://tees.academia.edu/TheAnhHan?f_ri=2529","photo":"https://0.academia-photos.com/883505/321242/15364879/s65_the_anh.han.jpg"}</script></span></span></li><li class="js-paper-rank-work_1045227 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1045227"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1045227, container: ".js-paper-rank-work_1045227", }); });</script></li><li class="js-percentile-work_1045227 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1045227; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1045227"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1045227 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1045227"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1045227; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1045227]").text(description); $(".js-view-count-work_1045227").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1045227").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1045227"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="237" href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a>, <script data-card-contents-for-ri="237" type="text/json">{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1676" href="https://www.academia.edu/Documents/in/Cognitive_Modeling">Cognitive Modeling</a>, <script data-card-contents-for-ri="1676" type="text/json">{"id":1676,"name":"Cognitive Modeling","url":"https://www.academia.edu/Documents/in/Cognitive_Modeling?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1681" href="https://www.academia.edu/Documents/in/Decision_Making">Decision Making</a><script data-card-contents-for-ri="1681" type="text/json">{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1045227]'), work: {"id":1045227,"title":"Evolution prospection in decision making","created_at":"2011-10-26T23:16:53.439-07:00","url":"https://www.academia.edu/1045227/Evolution_prospection_in_decision_making?f_ri=2529","dom_id":"work_1045227","summary":"This work concerns the problem of modelling evolving prospective agent systems. Inasmuch a prospective agent [1] looks ahead a number of steps into the future, it is confronted with the problem of having several different possible courses of evolution, and therefore needs to be able to prefer amongst them to decide the best to follow as seen from its present state. First it needs a priori preferences for the generation of likely courses of evolution. Subsequently, this being one main contribution of this paper, based on the historical information as well as on a mixture of quantitative and qualitative a posteriori evaluation of its possible evolutions, we equip our agent with so-called evolution-level preferences mechanism, involving three distinct types of commitment. In addition, one other main contribution, to enable such a prospective agent to evolve, we provide a way for modelling its evolving knowledge base, including environment and course of evolution triggering of all active goals (desires), context-sensitive preferences and integrity constraints. We exhibit several examples to illustrate the proposed concepts.","downloadable_attachments":[{"id":6864334,"asset_id":1045227,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":883505,"first_name":"The Anh","last_name":"Han","domain_name":"tees","page_name":"TheAnhHan","display_name":"The Anh Han","profile_url":"https://tees.academia.edu/TheAnhHan?f_ri=2529","photo":"https://0.academia-photos.com/883505/321242/15364879/s65_the_anh.han.jpg"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science?f_ri=2529","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=2529","nofollow":false},{"id":1676,"name":"Cognitive Modeling","url":"https://www.academia.edu/Documents/in/Cognitive_Modeling?f_ri=2529","nofollow":false},{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":4275,"name":"Decision Sciences","url":"https://www.academia.edu/Documents/in/Decision_Sciences?f_ri=2529"},{"id":27183,"name":"Decision-Making","url":"https://www.academia.edu/Documents/in/Decision-Making?f_ri=2529"},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_49997310" data-work_id="49997310" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/49997310/An_Analysis_of_the_Computational_Complexity_of_DeLP_through_Game_Semantics">An Analysis of the Computational Complexity of DeLP through Game Semantics</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Defeasible Logic Programming (DeLP) is a suitable tool for knowledge representation and reasoning. Its operational semantics is based on a dialectical analysis where arguments for and against a literal interact in order to determine... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_49997310" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Defeasible Logic Programming (DeLP) is a suitable tool for knowledge representation and reasoning. Its operational semantics is based on a dialectical analysis where arguments for and against a literal interact in order to determine whether this literal is believed by a reasoning agent. The semantics GS is a declarative trivalued game-based semantics for DeLP that is sound and complete for DeLP operational semantics. Complexity theory has become an important tool for comparing different formalism and for helping to ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/49997310" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="8e5dd7918c19b72c111654c06c18c7aa" rel="nofollow" data-download="{"attachment_id":68146828,"asset_id":49997310,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68146828/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="73244095" href="https://independent.academia.edu/GuillermoRSimari">Guillermo R. Simari</a><script data-card-contents-for-user="73244095" type="text/json">{"id":73244095,"first_name":"Guillermo R.","last_name":"Simari","domain_name":"independent","page_name":"GuillermoRSimari","display_name":"Guillermo R. Simari","profile_url":"https://independent.academia.edu/GuillermoRSimari?f_ri=2529","photo":"https://0.academia-photos.com/73244095/19994368/19779915/s65_guillermo_r..simari.png"}</script></span></span></li><li class="js-paper-rank-work_49997310 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="49997310"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 49997310, container: ".js-paper-rank-work_49997310", }); });</script></li><li class="js-percentile-work_49997310 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 49997310; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_49997310"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_49997310 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="49997310"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 49997310; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=49997310]").text(description); $(".js-view-count-work_49997310").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_49997310").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="49997310"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">10</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2189" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a>, <script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2349" href="https://www.academia.edu/Documents/in/Semantics">Semantics</a>, <script data-card-contents-for-ri="2349" type="text/json">{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2530" href="https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_">Defeasible Reasoning (Computer Science)</a><script data-card-contents-for-ri="2530" type="text/json">{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=49997310]'), work: {"id":49997310,"title":"An Analysis of the Computational Complexity of DeLP through Game Semantics","created_at":"2021-07-16T14:58:54.356-07:00","url":"https://www.academia.edu/49997310/An_Analysis_of_the_Computational_Complexity_of_DeLP_through_Game_Semantics?f_ri=2529","dom_id":"work_49997310","summary":"Defeasible Logic Programming (DeLP) is a suitable tool for knowledge representation and reasoning. Its operational semantics is based on a dialectical analysis where arguments for and against a literal interact in order to determine whether this literal is believed by a reasoning agent. The semantics GS is a declarative trivalued game-based semantics for DeLP that is sound and complete for DeLP operational semantics. Complexity theory has become an important tool for comparing different formalism and for helping to ...","downloadable_attachments":[{"id":68146828,"asset_id":49997310,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":73244095,"first_name":"Guillermo R.","last_name":"Simari","domain_name":"independent","page_name":"GuillermoRSimari","display_name":"Guillermo R. Simari","profile_url":"https://independent.academia.edu/GuillermoRSimari?f_ri=2529","photo":"https://0.academia-photos.com/73244095/19994368/19779915/s65_guillermo_r..simari.png"}],"research_interests":[{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=2529","nofollow":false},{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":2530,"name":"Defeasible Reasoning (Computer Science)","url":"https://www.academia.edu/Documents/in/Defeasible_Reasoning_Computer_Science_?f_ri=2529","nofollow":false},{"id":3155,"name":"Complexity Theory","url":"https://www.academia.edu/Documents/in/Complexity_Theory?f_ri=2529"},{"id":192745,"name":"Operational Semantics","url":"https://www.academia.edu/Documents/in/Operational_Semantics?f_ri=2529"},{"id":287095,"name":"Knowledge Representation and Reasoning","url":"https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning?f_ri=2529"},{"id":349059,"name":"Decision Problem","url":"https://www.academia.edu/Documents/in/Decision_Problem?f_ri=2529"},{"id":396234,"name":"Complexity Analysis","url":"https://www.academia.edu/Documents/in/Complexity_Analysis?f_ri=2529"},{"id":914492,"name":"Game semantics","url":"https://www.academia.edu/Documents/in/Game_semantics?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_13522506" data-work_id="13522506" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/13522506/Rethinking_Machine_Ethics_in_an_Era_of_Ubiquitous_Technology">Rethinking Machine Ethics in an Era of Ubiquitous Technology</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This timely publication features thoroughly researched articles on the topics of artificial moral agency, cyber-warfare, transhumanism, organic neural nets, human worker replacement, automaticity and global governance, security and... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_13522506" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This timely publication features thoroughly researched articles on the topics of artificial moral agency, cyber-warfare, transhumanism, organic neural nets, human worker replacement, automaticity and global governance, security and surveillance, military drones, and more.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/13522506" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="abd0605c5e4cec0e35f9a49cf5cebc0a" rel="nofollow" data-download="{"attachment_id":38065473,"asset_id":13522506,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/38065473/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="2654119" href="https://unl-pt.academia.edu/jeffwhite">jeff white</a><script data-card-contents-for-user="2654119" type="text/json">{"id":2654119,"first_name":"jeff","last_name":"white","domain_name":"unl-pt","page_name":"jeffwhite","display_name":"jeff white","profile_url":"https://unl-pt.academia.edu/jeffwhite?f_ri=2529","photo":"https://0.academia-photos.com/2654119/2576635/111377605/s65_jeff.white.jpg"}</script></span></span></li><li class="js-paper-rank-work_13522506 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="13522506"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 13522506, container: ".js-paper-rank-work_13522506", }); });</script></li><li class="js-percentile-work_13522506 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 13522506; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_13522506"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_13522506 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="13522506"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 13522506; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=13522506]").text(description); $(".js-view-count-work_13522506").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_13522506").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="13522506"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="46" href="https://www.academia.edu/Documents/in/Business_Ethics">Business Ethics</a>, <script data-card-contents-for-ri="46" type="text/json">{"id":46,"name":"Business Ethics","url":"https://www.academia.edu/Documents/in/Business_Ethics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="255" href="https://www.academia.edu/Documents/in/Evolutionary_Psychology">Evolutionary Psychology</a>, <script data-card-contents-for-ri="255" type="text/json">{"id":255,"name":"Evolutionary Psychology","url":"https://www.academia.edu/Documents/in/Evolutionary_Psychology?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1697" href="https://www.academia.edu/Documents/in/Violence">Violence</a><script data-card-contents-for-ri="1697" type="text/json">{"id":1697,"name":"Violence","url":"https://www.academia.edu/Documents/in/Violence?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=13522506]'), work: {"id":13522506,"title":"Rethinking Machine Ethics in an Era of Ubiquitous Technology","created_at":"2015-07-01T21:53:34.428-07:00","url":"https://www.academia.edu/13522506/Rethinking_Machine_Ethics_in_an_Era_of_Ubiquitous_Technology?f_ri=2529","dom_id":"work_13522506","summary":"This timely publication features thoroughly researched articles on the topics of artificial moral agency, cyber-warfare, transhumanism, organic neural nets, human worker replacement, automaticity and global governance, security and surveillance, military drones, and more.","downloadable_attachments":[{"id":38065473,"asset_id":13522506,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":2654119,"first_name":"jeff","last_name":"white","domain_name":"unl-pt","page_name":"jeffwhite","display_name":"jeff white","profile_url":"https://unl-pt.academia.edu/jeffwhite?f_ri=2529","photo":"https://0.academia-photos.com/2654119/2576635/111377605/s65_jeff.white.jpg"}],"research_interests":[{"id":46,"name":"Business Ethics","url":"https://www.academia.edu/Documents/in/Business_Ethics?f_ri=2529","nofollow":false},{"id":255,"name":"Evolutionary Psychology","url":"https://www.academia.edu/Documents/in/Evolutionary_Psychology?f_ri=2529","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":1697,"name":"Violence","url":"https://www.academia.edu/Documents/in/Violence?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":3115,"name":"Posthumanism","url":"https://www.academia.edu/Documents/in/Posthumanism?f_ri=2529"},{"id":11861,"name":"Transhumanism","url":"https://www.academia.edu/Documents/in/Transhumanism?f_ri=2529"},{"id":12973,"name":"Just War Theory","url":"https://www.academia.edu/Documents/in/Just_War_Theory?f_ri=2529"},{"id":104732,"name":"Machine Ethics","url":"https://www.academia.edu/Documents/in/Machine_Ethics?f_ri=2529"},{"id":123434,"name":"State Violence","url":"https://www.academia.edu/Documents/in/State_Violence?f_ri=2529"},{"id":136271,"name":"Robot ethics","url":"https://www.academia.edu/Documents/in/Robot_ethics?f_ri=2529"},{"id":329707,"name":"Drones","url":"https://www.academia.edu/Documents/in/Drones?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_30105728" data-work_id="30105728" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/30105728/Bulletin_Points_for_Analytical_Critique">Bulletin-Points for Analytical Critique</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest">Major ideas found in philosophy of logic and by implication Nathan Coppedge's philosophy.</div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/30105728" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a83f2206b92f92f12a116564fc083526" rel="nofollow" data-download="{"attachment_id":50571012,"asset_id":30105728,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50571012/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5746293" href="https://southernct.academia.edu/NathanCoppedge">Nathan Coppedge</a><script data-card-contents-for-user="5746293" type="text/json">{"id":5746293,"first_name":"Nathan","last_name":"Coppedge","domain_name":"southernct","page_name":"NathanCoppedge","display_name":"Nathan Coppedge","profile_url":"https://southernct.academia.edu/NathanCoppedge?f_ri=2529","photo":"https://0.academia-photos.com/5746293/2482759/76140274/s65_nathan.coppedge.jpg"}</script></span></span></li><li class="js-paper-rank-work_30105728 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="30105728"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 30105728, container: ".js-paper-rank-work_30105728", }); });</script></li><li class="js-percentile-work_30105728 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 30105728; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_30105728"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_30105728 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="30105728"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 30105728; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=30105728]").text(description); $(".js-view-count-work_30105728").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_30105728").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="30105728"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">73</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="8" href="https://www.academia.edu/Documents/in/Critical_Theory">Critical Theory</a>, <script data-card-contents-for-ri="8" type="text/json">{"id":8,"name":"Critical Theory","url":"https://www.academia.edu/Documents/in/Critical_Theory?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="361" href="https://www.academia.edu/Documents/in/Modal_Logic">Modal Logic</a>, <script data-card-contents-for-ri="361" type="text/json">{"id":361,"name":"Modal Logic","url":"https://www.academia.edu/Documents/in/Modal_Logic?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="804" href="https://www.academia.edu/Documents/in/Metaphysics">Metaphysics</a>, <script data-card-contents-for-ri="804" type="text/json">{"id":804,"name":"Metaphysics","url":"https://www.academia.edu/Documents/in/Metaphysics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="805" href="https://www.academia.edu/Documents/in/Ontology">Ontology</a><script data-card-contents-for-ri="805" type="text/json">{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=30105728]'), work: {"id":30105728,"title":"Bulletin-Points for Analytical Critique","created_at":"2016-11-27T04:33:23.909-08:00","url":"https://www.academia.edu/30105728/Bulletin_Points_for_Analytical_Critique?f_ri=2529","dom_id":"work_30105728","summary":"Major ideas found in philosophy of logic and by implication Nathan Coppedge's philosophy.","downloadable_attachments":[{"id":50571012,"asset_id":30105728,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5746293,"first_name":"Nathan","last_name":"Coppedge","domain_name":"southernct","page_name":"NathanCoppedge","display_name":"Nathan Coppedge","profile_url":"https://southernct.academia.edu/NathanCoppedge?f_ri=2529","photo":"https://0.academia-photos.com/5746293/2482759/76140274/s65_nathan.coppedge.jpg"}],"research_interests":[{"id":8,"name":"Critical Theory","url":"https://www.academia.edu/Documents/in/Critical_Theory?f_ri=2529","nofollow":false},{"id":361,"name":"Modal Logic","url":"https://www.academia.edu/Documents/in/Modal_Logic?f_ri=2529","nofollow":false},{"id":804,"name":"Metaphysics","url":"https://www.academia.edu/Documents/in/Metaphysics?f_ri=2529","nofollow":false},{"id":805,"name":"Ontology","url":"https://www.academia.edu/Documents/in/Ontology?f_ri=2529","nofollow":false},{"id":809,"name":"Analytic Philosophy","url":"https://www.academia.edu/Documents/in/Analytic_Philosophy?f_ri=2529"},{"id":924,"name":"Logic","url":"https://www.academia.edu/Documents/in/Logic?f_ri=2529"},{"id":936,"name":"History of Analytic Philosophy","url":"https://www.academia.edu/Documents/in/History_of_Analytic_Philosophy?f_ri=2529"},{"id":953,"name":"Rhetoric","url":"https://www.academia.edu/Documents/in/Rhetoric?f_ri=2529"},{"id":2010,"name":"Computational Logic","url":"https://www.academia.edu/Documents/in/Computational_Logic?f_ri=2529"},{"id":2392,"name":"Proof Theory","url":"https://www.academia.edu/Documents/in/Proof_Theory?f_ri=2529"},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529"},{"id":5972,"name":"History of Logic","url":"https://www.academia.edu/Documents/in/History_of_Logic?f_ri=2529"},{"id":6087,"name":"Deductive reasoning","url":"https://www.academia.edu/Documents/in/Deductive_reasoning?f_ri=2529"},{"id":6571,"name":"Category Theory","url":"https://www.academia.edu/Documents/in/Category_Theory?f_ri=2529"},{"id":8612,"name":"Argumentation","url":"https://www.academia.edu/Documents/in/Argumentation?f_ri=2529"},{"id":11104,"name":"Philosophical Logic","url":"https://www.academia.edu/Documents/in/Philosophical_Logic?f_ri=2529"},{"id":12685,"name":"Epistemic Logic","url":"https://www.academia.edu/Documents/in/Epistemic_Logic?f_ri=2529"},{"id":13279,"name":"Philosophy of Logic","url":"https://www.academia.edu/Documents/in/Philosophy_of_Logic?f_ri=2529"},{"id":13742,"name":"Logical Constants","url":"https://www.academia.edu/Documents/in/Logical_Constants?f_ri=2529"},{"id":17442,"name":"Mathematical Logic","url":"https://www.academia.edu/Documents/in/Mathematical_Logic?f_ri=2529"},{"id":18574,"name":"Inference","url":"https://www.academia.edu/Documents/in/Inference?f_ri=2529"},{"id":19927,"name":"Analytical Method Development","url":"https://www.academia.edu/Documents/in/Analytical_Method_Development?f_ri=2529"},{"id":20094,"name":"Object Oriented Ontology","url":"https://www.academia.edu/Documents/in/Object_Oriented_Ontology?f_ri=2529"},{"id":22629,"name":"Temporal Logics","url":"https://www.academia.edu/Documents/in/Temporal_Logics?f_ri=2529"},{"id":23393,"name":"Objectivism (Philosophy)","url":"https://www.academia.edu/Documents/in/Objectivism_Philosophy_?f_ri=2529"},{"id":28299,"name":"Argumentation Theory and Critical Thinking","url":"https://www.academia.edu/Documents/in/Argumentation_Theory_and_Critical_Thinking?f_ri=2529"},{"id":28523,"name":"Causal Inference","url":"https://www.academia.edu/Documents/in/Causal_Inference?f_ri=2529"},{"id":29236,"name":"Continental (vs.) Analytical Philosophy","url":"https://www.academia.edu/Documents/in/Continental_vs._Analytical_Philosophy?f_ri=2529"},{"id":29875,"name":"Higher-order logics","url":"https://www.academia.edu/Documents/in/Higher-order_logics?f_ri=2529"},{"id":33324,"name":"Informal Logic","url":"https://www.academia.edu/Documents/in/Informal_Logic?f_ri=2529"},{"id":38015,"name":"Substructural Logics","url":"https://www.academia.edu/Documents/in/Substructural_Logics?f_ri=2529"},{"id":39705,"name":"Description logics","url":"https://www.academia.edu/Documents/in/Description_logics?f_ri=2529"},{"id":62219,"name":"Modal and Temporal Logics","url":"https://www.academia.edu/Documents/in/Modal_and_Temporal_Logics?f_ri=2529"},{"id":63857,"name":"Categorical data analysis","url":"https://www.academia.edu/Documents/in/Categorical_data_analysis?f_ri=2529"},{"id":71149,"name":"Categorical Abstract Machine","url":"https://www.academia.edu/Documents/in/Categorical_Abstract_Machine?f_ri=2529"},{"id":76577,"name":"Philosophy of Language (esp. Wittgenstein, Rule-following, and the Normativity of Meaning)","url":"https://www.academia.edu/Documents/in/Philosophy_of_Language_esp._Wittgenstein_Rule-following_and_the_Normativity_of_Meaning_?f_ri=2529"},{"id":79503,"name":"History of Informal Logic","url":"https://www.academia.edu/Documents/in/History_of_Informal_Logic?f_ri=2529"},{"id":91067,"name":"Non-Classical Logics","url":"https://www.academia.edu/Documents/in/Non-Classical_Logics?f_ri=2529"},{"id":102173,"name":"Functional Logic Programming","url":"https://www.academia.edu/Documents/in/Functional_Logic_Programming?f_ri=2529"},{"id":114045,"name":"Categorical Perception","url":"https://www.academia.edu/Documents/in/Categorical_Perception?f_ri=2529"},{"id":157575,"name":"Syllogisms","url":"https://www.academia.edu/Documents/in/Syllogisms?f_ri=2529"},{"id":190657,"name":"Categorical Logic","url":"https://www.academia.edu/Documents/in/Categorical_Logic?f_ri=2529"},{"id":204705,"name":"Analytical Hierarchy Process (AHP)","url":"https://www.academia.edu/Documents/in/Analytical_Hierarchy_Process_AHP_?f_ri=2529"},{"id":304338,"name":"Categorical Topology","url":"https://www.academia.edu/Documents/in/Categorical_Topology?f_ri=2529"},{"id":322615,"name":"Coherentism","url":"https://www.academia.edu/Documents/in/Coherentism?f_ri=2529"},{"id":361778,"name":"Logics","url":"https://www.academia.edu/Documents/in/Logics?f_ri=2529"},{"id":373610,"name":"Categorical Variables","url":"https://www.academia.edu/Documents/in/Categorical_Variables?f_ri=2529"},{"id":423655,"name":"Analytical Philosophy of Literature","url":"https://www.academia.edu/Documents/in/Analytical_Philosophy_of_Literature?f_ri=2529"},{"id":432226,"name":"Contemporary analytical philosophy","url":"https://www.academia.edu/Documents/in/Contemporary_analytical_philosophy?f_ri=2529"},{"id":444110,"name":"Logics in Computer Science","url":"https://www.academia.edu/Documents/in/Logics_in_Computer_Science?f_ri=2529"},{"id":449205,"name":"Analytical Techniques","url":"https://www.academia.edu/Documents/in/Analytical_Techniques?f_ri=2529"},{"id":510596,"name":"Philosophy of Logic, Logical Consequence","url":"https://www.academia.edu/Documents/in/Philosophy_of_Logic_Logical_Consequence?f_ri=2529"},{"id":516567,"name":"Analytical/Wittgensteinian Philosophy","url":"https://www.academia.edu/Documents/in/Analytical_Wittgensteinian_Philosophy?f_ri=2529"},{"id":517233,"name":"History of Analytical Philosophy","url":"https://www.academia.edu/Documents/in/History_of_Analytical_Philosophy?f_ri=2529"},{"id":739320,"name":"Categorical Content Analysis","url":"https://www.academia.edu/Documents/in/Categorical_Content_Analysis?f_ri=2529"},{"id":910147,"name":"Mathematical Reasoning and Proofs","url":"https://www.academia.edu/Documents/in/Mathematical_Reasoning_and_Proofs?f_ri=2529"},{"id":977116,"name":"Action Logics","url":"https://www.academia.edu/Documents/in/Action_Logics?f_ri=2529"},{"id":1050158,"name":"Analytical and Continental Philosophy","url":"https://www.academia.edu/Documents/in/Analytical_and_Continental_Philosophy?f_ri=2529"},{"id":1223747,"name":"Early Wittgenstein","url":"https://www.academia.edu/Documents/in/Early_Wittgenstein?f_ri=2529"},{"id":1243543,"name":"Ludwig Wittgenstein","url":"https://www.academia.edu/Documents/in/Ludwig_Wittgenstein?f_ri=2529"},{"id":1374556,"name":"Analytical Philosophy","url":"https://www.academia.edu/Documents/in/Analytical_Philosophy?f_ri=2529"},{"id":1378321,"name":"Categorical Philosophy","url":"https://www.academia.edu/Documents/in/Categorical_Philosophy?f_ri=2529"},{"id":1578148,"name":"Philosophy of Ideology","url":"https://www.academia.edu/Documents/in/Philosophy_of_Ideology?f_ri=2529"},{"id":1592365,"name":"Ludwig Josef Johann Wittgenstein","url":"https://www.academia.edu/Documents/in/Ludwig_Josef_Johann_Wittgenstein?f_ri=2529"},{"id":1808932,"name":"Coherentist Theories of Epistemic Justification","url":"https://www.academia.edu/Documents/in/Coherentist_Theories_of_Epistemic_Justification?f_ri=2529"},{"id":1983239,"name":"Analytical Philosophy of Language","url":"https://www.academia.edu/Documents/in/Analytical_Philosophy_of_Language?f_ri=2529"},{"id":2479540,"name":"Logic of Aesthetics","url":"https://www.academia.edu/Documents/in/Logic_of_Aesthetics?f_ri=2529"},{"id":2525855,"name":"Non-Randian objectivism","url":"https://www.academia.edu/Documents/in/Non-Randian_objectivism?f_ri=2529"},{"id":2574672,"name":"coherence theory","url":"https://www.academia.edu/Documents/in/coherence_theory?f_ri=2529"},{"id":2576688,"name":"philosophical critique","url":"https://www.academia.edu/Documents/in/philosophical_critique?f_ri=2529"},{"id":2576690,"name":"logical proofs","url":"https://www.academia.edu/Documents/in/logical_proofs?f_ri=2529"},{"id":2576691,"name":"perfect reasoning","url":"https://www.academia.edu/Documents/in/perfect_reasoning?f_ri=2529"},{"id":2576694,"name":"coherence theory of truth","url":"https://www.academia.edu/Documents/in/coherence_theory_of_truth?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6097352" data-work_id="6097352" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6097352/Mastering_Master_Mind_logically">Mastering Master Mind logically</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6097352" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5f113bfe1d51036c6411b8fb542a6100" rel="nofollow" data-download="{"attachment_id":33183143,"asset_id":6097352,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/33183143/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="9206011" href="https://princeton.academia.edu/PeterKoppstein">Peter Koppstein</a><script data-card-contents-for-user="9206011" type="text/json">{"id":9206011,"first_name":"Peter","last_name":"Koppstein","domain_name":"princeton","page_name":"PeterKoppstein","display_name":"Peter Koppstein","profile_url":"https://princeton.academia.edu/PeterKoppstein?f_ri=2529","photo":"https://0.academia-photos.com/9206011/3084733/3629642/s65_peter.koppstein.jpg"}</script></span></span></li><li class="js-paper-rank-work_6097352 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6097352"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6097352, container: ".js-paper-rank-work_6097352", }); });</script></li><li class="js-percentile-work_6097352 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6097352; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6097352"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6097352 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6097352"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6097352; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6097352]").text(description); $(".js-view-count-work_6097352").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6097352").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6097352"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">2</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="52558" href="https://www.academia.edu/Documents/in/Prolog">Prolog</a><script data-card-contents-for-ri="52558" type="text/json">{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6097352]'), work: {"id":6097352,"title":"Mastering Master Mind logically","created_at":"2014-02-16T12:42:28.122-08:00","url":"https://www.academia.edu/6097352/Mastering_Master_Mind_logically?f_ri=2529","dom_id":"work_6097352","summary":null,"downloadable_attachments":[{"id":33183143,"asset_id":6097352,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":9206011,"first_name":"Peter","last_name":"Koppstein","domain_name":"princeton","page_name":"PeterKoppstein","display_name":"Peter Koppstein","profile_url":"https://princeton.academia.edu/PeterKoppstein?f_ri=2529","photo":"https://0.academia-photos.com/9206011/3084733/3629642/s65_peter.koppstein.jpg"}],"research_interests":[{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_34338694" data-work_id="34338694" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/34338694/Automatic_data_mapping_of_signal_processing_applications">Automatic data mapping of signal processing applications</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/34338694" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b091934f7d5078cad4390b299652110f" rel="nofollow" data-download="{"attachment_id":54233273,"asset_id":34338694,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/54233273/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="67561733" href="https://mines-paristech.academia.edu/FIrigoin">F. Irigoin</a><script data-card-contents-for-user="67561733" type="text/json">{"id":67561733,"first_name":"F.","last_name":"Irigoin","domain_name":"mines-paristech","page_name":"FIrigoin","display_name":"F. Irigoin","profile_url":"https://mines-paristech.academia.edu/FIrigoin?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_34338694 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="34338694"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 34338694, container: ".js-paper-rank-work_34338694", }); });</script></li><li class="js-percentile-work_34338694 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 34338694; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_34338694"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_34338694 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="34338694"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 34338694; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=34338694]").text(description); $(".js-view-count-work_34338694").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_34338694").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="34338694"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">12</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="440" href="https://www.academia.edu/Documents/in/Distributed_Computing">Distributed Computing</a>, <script data-card-contents-for-ri="440" type="text/json">{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2141" href="https://www.academia.edu/Documents/in/Signal_Processing">Signal Processing</a>, <script data-card-contents-for-ri="2141" type="text/json">{"id":2141,"name":"Signal Processing","url":"https://www.academia.edu/Documents/in/Signal_Processing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5447" href="https://www.academia.edu/Documents/in/Linear_Programming">Linear Programming</a><script data-card-contents-for-ri="5447" type="text/json">{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=34338694]'), work: {"id":34338694,"title":"Automatic data mapping of signal processing applications","created_at":"2017-08-24T06:22:05.471-07:00","url":"https://www.academia.edu/34338694/Automatic_data_mapping_of_signal_processing_applications?f_ri=2529","dom_id":"work_34338694","summary":null,"downloadable_attachments":[{"id":54233273,"asset_id":34338694,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":67561733,"first_name":"F.","last_name":"Irigoin","domain_name":"mines-paristech","page_name":"FIrigoin","display_name":"F. Irigoin","profile_url":"https://mines-paristech.academia.edu/FIrigoin?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":440,"name":"Distributed Computing","url":"https://www.academia.edu/Documents/in/Distributed_Computing?f_ri=2529","nofollow":false},{"id":2141,"name":"Signal Processing","url":"https://www.academia.edu/Documents/in/Signal_Processing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=2529","nofollow":false},{"id":9038,"name":"Digital Signal Processing","url":"https://www.academia.edu/Documents/in/Digital_Signal_Processing?f_ri=2529"},{"id":14118,"name":"Distributed Shared Memory System","url":"https://www.academia.edu/Documents/in/Distributed_Shared_Memory_System?f_ri=2529"},{"id":17270,"name":"Application Integration (Computer Science)","url":"https://www.academia.edu/Documents/in/Application_Integration_Computer_Science_?f_ri=2529"},{"id":229390,"name":"Real Time","url":"https://www.academia.edu/Documents/in/Real_Time?f_ri=2529"},{"id":286183,"name":"Enterprise Application Integration (EAI)","url":"https://www.academia.edu/Documents/in/Enterprise_Application_Integration_EAI_?f_ri=2529"},{"id":507975,"name":"Parallel Machines","url":"https://www.academia.edu/Documents/in/Parallel_Machines?f_ri=2529"},{"id":1510986,"name":"Data Partitioning","url":"https://www.academia.edu/Documents/in/Data_Partitioning?f_ri=2529"},{"id":1931321,"name":"Application Software","url":"https://www.academia.edu/Documents/in/Application_Software?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3808972" data-work_id="3808972" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3808972/Prolog_Tutorial_1">Prolog Tutorial 1</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3808972" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="776e4acd8739da5f978a27d701696291" rel="nofollow" data-download="{"attachment_id":31464438,"asset_id":3808972,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31464438/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="3828471" href="https://independent.academia.edu/CliveSpenser">Clive Spenser</a><script data-card-contents-for-user="3828471" type="text/json">{"id":3828471,"first_name":"Clive","last_name":"Spenser","domain_name":"independent","page_name":"CliveSpenser","display_name":"Clive Spenser","profile_url":"https://independent.academia.edu/CliveSpenser?f_ri=2529","photo":"https://0.academia-photos.com/3828471/1398047/1718894/s65_clive.spenser.jpg"}</script></span></span></li><li class="js-paper-rank-work_3808972 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3808972"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3808972, container: ".js-paper-rank-work_3808972", }); });</script></li><li class="js-percentile-work_3808972 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3808972; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3808972"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3808972 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3808972"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3808972; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3808972]").text(description); $(".js-view-count-work_3808972").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3808972").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3808972"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="470" href="https://www.academia.edu/Documents/in/Expert_Systems">Expert Systems</a>, <script data-card-contents-for-ri="470" type="text/json">{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="52558" href="https://www.academia.edu/Documents/in/Prolog">Prolog</a><script data-card-contents-for-ri="52558" type="text/json">{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3808972]'), work: {"id":3808972,"title":"Prolog Tutorial 1","created_at":"2013-06-28T00:10:57.235-07:00","url":"https://www.academia.edu/3808972/Prolog_Tutorial_1?f_ri=2529","dom_id":"work_3808972","summary":null,"downloadable_attachments":[{"id":31464438,"asset_id":3808972,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":3828471,"first_name":"Clive","last_name":"Spenser","domain_name":"independent","page_name":"CliveSpenser","display_name":"Clive Spenser","profile_url":"https://independent.academia.edu/CliveSpenser?f_ri=2529","photo":"https://0.academia-photos.com/3828471/1398047/1718894/s65_clive.spenser.jpg"}],"research_interests":[{"id":470,"name":"Expert Systems","url":"https://www.academia.edu/Documents/in/Expert_Systems?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":52558,"name":"Prolog","url":"https://www.academia.edu/Documents/in/Prolog?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_35986020" data-work_id="35986020" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/35986020/Alulr%C3%B3l_felfel%C3%A9_elemz%C3%A9s_a_Contralog_DCG_formalizmus%C3%A1val_Bottom_up_parsing_by_the_DCG_formalism_of_Contralog_Kili%C3%A1n_Imre">Alulról felfelé elemzés a Contralog DCG formalizmusával Bottom-up parsing by the DCG formalism of Contralog Kilián Imre</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Prolog's DCG package is suitable to create top-down parsers easily – not even determinacy is a demand, because Prolog can easily manage it. This, however, means some loss of efficiency in a number of cases, when grammatically significal... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_35986020" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Prolog's DCG package is suitable to create top-down parsers easily – not even determinacy is a demand, because Prolog can easily manage it. This, however, means some loss of efficiency in a number of cases, when grammatically significal words are appearing in the end of sentences, because we must backtrack deeply in such cases. To process free word order languages is likewise hard. The article talks about the operation of a DCG parser, but in a Contralog environment. This solves just the problem mentioned before: from the DCG grammar description it generates a bottom-up parser. Összefoglaló A Prolog ba épített DCG csomaggal könnyen lehet fentről lefelé haladó nyelvi elemzőket létrehozni, ahol még a determinisztikusság sem követelmény – a Prolog mindezt jól kezeli. Ám ugyanez hatékonyságvesztést is jelenthet egy sor olyan esetben, ahol a szignifikáns nyelvi elemek a mondatok végefelé vannak, mert ilyenkor mély visszalépésekre van szükség, de ez szabad szórendű nyelvek elemzésekor sem eléggé hatékony. A dolgozat a korábban már közölt Contralog nevű Prolog kiterjesztésre épülő DCG elemző működését tárgyalja, amely éppen az említ ett gondot oldja meg: a DCG nyelvtanleírásból egy alulról felfelé haladó elemző algoritmus működtetésével. Kulcsszavak Prolog, DCG, alulról felfelé haladó elemzés, természetes nyelvek elemzése 1. BEVEZETÉS A nyelvtani elemzés (parsing) témaköre egy igen lén yeges kérdés egy sor szoftver termékben. Nem csak a természetes nyelveket elemző vagy fordító, jobbára kísérleti szoftverekről van szó, hanem a legkülönfélébb gyakorlati területről is, ahol kisebb-nagyobb bonyolultságú, és általában valamilyen kézenfekvő célra használt formális nyelv mondatainak elemzése a feladat. A nyelvtani elemzés feladata az adott mondat és a mondatszimbólum, mint nemterminális közötti elemzési fának (környezetfüggetlen esetben), ill. elemzési gráfnak a megkeresése és előállítása. Az e lemzési fa gyökéreleme a mondatszimbólum (nemterminális), a levélelemei pedig a bemenő célnyelvi mondat egyes terminális szimbólumai. Ha elemzési fából csak egyetlenegy létezik bármilyen bemenő mondatra, akkor a nyelvtan egyértelmű, egyébként többértelmű. Az elemzés feladata nemdeterminisztikusan is érthető: többértelmű nyelvtan esetén az elemzésnek az összes lehetséges elemzési fát elő kell állítania [1]. Az elemzési fa előállítása során a fa mérete a bemenő mondat hosszával négyzetes arányban van, míg a p árhuzamos elemzések fái még egy további szorzót eredményeznek. Az elemzés helyigénye tehát általános esetben szintén a mondat hosszával kb. köbös N 3 arányban van. A köbös</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/35986020" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a83c8b7f3fcffcc0fd2402d5e7dae5c4" rel="nofollow" data-download="{"attachment_id":55870916,"asset_id":35986020,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/55870916/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="28347438" href="https://commonline.academia.edu/ImreKili%C3%A1n">Imre Kilián</a><script data-card-contents-for-user="28347438" type="text/json">{"id":28347438,"first_name":"Imre","last_name":"Kilián","domain_name":"commonline","page_name":"ImreKilián","display_name":"Imre Kilián","profile_url":"https://commonline.academia.edu/ImreKili%C3%A1n?f_ri=2529","photo":"https://0.academia-photos.com/28347438/8005526/38224248/s65_imre.kili_n.jpg"}</script></span></span></li><li class="js-paper-rank-work_35986020 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="35986020"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 35986020, container: ".js-paper-rank-work_35986020", }); });</script></li><li class="js-percentile-work_35986020 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 35986020; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_35986020"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_35986020 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="35986020"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 35986020; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=35986020]").text(description); $(".js-view-count-work_35986020").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_35986020").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="35986020"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">3</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1432" href="https://www.academia.edu/Documents/in/Natural_Language_Processing">Natural Language Processing</a>, <script data-card-contents-for-ri="1432" type="text/json">{"id":1432,"name":"Natural Language Processing","url":"https://www.academia.edu/Documents/in/Natural_Language_Processing?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=35986020]'), work: {"id":35986020,"title":"Alulról felfelé elemzés a Contralog DCG formalizmusával Bottom-up parsing by the DCG formalism of Contralog Kilián Imre","created_at":"2018-02-22T04:24:56.081-08:00","url":"https://www.academia.edu/35986020/Alulr%C3%B3l_felfel%C3%A9_elemz%C3%A9s_a_Contralog_DCG_formalizmus%C3%A1val_Bottom_up_parsing_by_the_DCG_formalism_of_Contralog_Kili%C3%A1n_Imre?f_ri=2529","dom_id":"work_35986020","summary":"Prolog's DCG package is suitable to create top-down parsers easily – not even determinacy is a demand, because Prolog can easily manage it. This, however, means some loss of efficiency in a number of cases, when grammatically significal words are appearing in the end of sentences, because we must backtrack deeply in such cases. To process free word order languages is likewise hard. The article talks about the operation of a DCG parser, but in a Contralog environment. This solves just the problem mentioned before: from the DCG grammar description it generates a bottom-up parser. Összefoglaló A Prolog ba épített DCG csomaggal könnyen lehet fentről lefelé haladó nyelvi elemzőket létrehozni, ahol még a determinisztikusság sem követelmény – a Prolog mindezt jól kezeli. Ám ugyanez hatékonyságvesztést is jelenthet egy sor olyan esetben, ahol a szignifikáns nyelvi elemek a mondatok végefelé vannak, mert ilyenkor mély visszalépésekre van szükség, de ez szabad szórendű nyelvek elemzésekor sem eléggé hatékony. A dolgozat a korábban már közölt Contralog nevű Prolog kiterjesztésre épülő DCG elemző működését tárgyalja, amely éppen az említ ett gondot oldja meg: a DCG nyelvtanleírásból egy alulról felfelé haladó elemző algoritmus működtetésével. Kulcsszavak Prolog, DCG, alulról felfelé haladó elemzés, természetes nyelvek elemzése 1. BEVEZETÉS A nyelvtani elemzés (parsing) témaköre egy igen lén yeges kérdés egy sor szoftver termékben. Nem csak a természetes nyelveket elemző vagy fordító, jobbára kísérleti szoftverekről van szó, hanem a legkülönfélébb gyakorlati területről is, ahol kisebb-nagyobb bonyolultságú, és általában valamilyen kézenfekvő célra használt formális nyelv mondatainak elemzése a feladat. A nyelvtani elemzés feladata az adott mondat és a mondatszimbólum, mint nemterminális közötti elemzési fának (környezetfüggetlen esetben), ill. elemzési gráfnak a megkeresése és előállítása. Az e lemzési fa gyökéreleme a mondatszimbólum (nemterminális), a levélelemei pedig a bemenő célnyelvi mondat egyes terminális szimbólumai. Ha elemzési fából csak egyetlenegy létezik bármilyen bemenő mondatra, akkor a nyelvtan egyértelmű, egyébként többértelmű. Az elemzés feladata nemdeterminisztikusan is érthető: többértelmű nyelvtan esetén az elemzésnek az összes lehetséges elemzési fát elő kell állítania [1]. Az elemzési fa előállítása során a fa mérete a bemenő mondat hosszával négyzetes arányban van, míg a p árhuzamos elemzések fái még egy további szorzót eredményeznek. Az elemzés helyigénye tehát általános esetben szintén a mondat hosszával kb. köbös N 3 arányban van. A köbös","downloadable_attachments":[{"id":55870916,"asset_id":35986020,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":28347438,"first_name":"Imre","last_name":"Kilián","domain_name":"commonline","page_name":"ImreKilián","display_name":"Imre Kilián","profile_url":"https://commonline.academia.edu/ImreKili%C3%A1n?f_ri=2529","photo":"https://0.academia-photos.com/28347438/8005526/38224248/s65_imre.kili_n.jpg"}],"research_interests":[{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=2529","nofollow":false},{"id":1432,"name":"Natural Language Processing","url":"https://www.academia.edu/Documents/in/Natural_Language_Processing?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5342909" data-work_id="5342909" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5342909/Integrating_voiceXML_with_SIP_services">Integrating voiceXML with SIP services</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5342909" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7b369626d1d399408ef754e0e49937d9" rel="nofollow" data-download="{"attachment_id":49333401,"asset_id":5342909,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49333401/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="7399030" href="https://ptudep.academia.edu/kundansingh">kundan singh</a><script data-card-contents-for-user="7399030" type="text/json">{"id":7399030,"first_name":"kundan","last_name":"singh","domain_name":"ptudep","page_name":"kundansingh","display_name":"kundan singh","profile_url":"https://ptudep.academia.edu/kundansingh?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_5342909 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5342909"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5342909, container: ".js-paper-rank-work_5342909", }); });</script></li><li class="js-percentile-work_5342909 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5342909; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5342909"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5342909 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5342909"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5342909; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5342909]").text(description); $(".js-view-count-work_5342909").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5342909").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5342909"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">11</a>  </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="464" href="https://www.academia.edu/Documents/in/Information_Retrieval">Information Retrieval</a>, <script data-card-contents-for-ri="464" type="text/json">{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2342" href="https://www.academia.edu/Documents/in/Speech_Synthesis">Speech Synthesis</a>, <script data-card-contents-for-ri="2342" type="text/json">{"id":2342,"name":"Speech Synthesis","url":"https://www.academia.edu/Documents/in/Speech_Synthesis?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a>, <script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5279" href="https://www.academia.edu/Documents/in/XML">XML</a><script data-card-contents-for-ri="5279" type="text/json">{"id":5279,"name":"XML","url":"https://www.academia.edu/Documents/in/XML?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5342909]'), work: {"id":5342909,"title":"Integrating voiceXML with SIP services","created_at":"2013-12-06T13:23:38.762-08:00","url":"https://www.academia.edu/5342909/Integrating_voiceXML_with_SIP_services?f_ri=2529","dom_id":"work_5342909","summary":null,"downloadable_attachments":[{"id":49333401,"asset_id":5342909,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":7399030,"first_name":"kundan","last_name":"singh","domain_name":"ptudep","page_name":"kundansingh","display_name":"kundan singh","profile_url":"https://ptudep.academia.edu/kundansingh?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=2529","nofollow":false},{"id":2342,"name":"Speech Synthesis","url":"https://www.academia.edu/Documents/in/Speech_Synthesis?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":5279,"name":"XML","url":"https://www.academia.edu/Documents/in/XML?f_ri=2529","nofollow":false},{"id":40360,"name":"Ip Telephony","url":"https://www.academia.edu/Documents/in/Ip_Telephony?f_ri=2529"},{"id":82999,"name":"Protocols","url":"https://www.academia.edu/Documents/in/Protocols?f_ri=2529"},{"id":178958,"name":"Session Initiation Protocol","url":"https://www.academia.edu/Documents/in/Session_Initiation_Protocol?f_ri=2529"},{"id":265348,"name":"Teleconferencing","url":"https://www.academia.edu/Documents/in/Teleconferencing?f_ri=2529"},{"id":806573,"name":"Web Server","url":"https://www.academia.edu/Documents/in/Web_Server?f_ri=2529"},{"id":1303437,"name":"Telecommunication Services","url":"https://www.academia.edu/Documents/in/Telecommunication_Services?f_ri=2529"},{"id":1548911,"name":"Test Bed","url":"https://www.academia.edu/Documents/in/Test_Bed?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5396567" data-work_id="5396567" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5396567/Logical_foundations_of_object_oriented_and_frame_based_languages">Logical foundations of object-oriented and frame-based languages</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5396567" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2b94e1a30a1b8f3eb7646ab51e7a7674" rel="nofollow" data-download="{"attachment_id":49308876,"asset_id":5396567,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49308876/download_file?st=MTczMjY4MjcyOCw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="7528297" href="https://independent.academia.edu/JamesWu3">James Wu</a><script data-card-contents-for-user="7528297" type="text/json">{"id":7528297,"first_name":"James","last_name":"Wu","domain_name":"independent","page_name":"JamesWu3","display_name":"James Wu","profile_url":"https://independent.academia.edu/JamesWu3?f_ri=2529","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_5396567 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5396567"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5396567, container: ".js-paper-rank-work_5396567", }); });</script></li><li class="js-percentile-work_5396567 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5396567; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5396567"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5396567 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5396567"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5396567; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5396567]").text(description); $(".js-view-count-work_5396567").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5396567").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5396567"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i>  <a class="InlineList-item-text u-positionRelative">8</a>  </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="453" href="https://www.academia.edu/Documents/in/Object_Oriented_Programming">Object Oriented Programming</a>, <script data-card-contents-for-ri="453" type="text/json">{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2349" href="https://www.academia.edu/Documents/in/Semantics">Semantics</a>, <script data-card-contents-for-ri="2349" type="text/json">{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2392" href="https://www.academia.edu/Documents/in/Proof_Theory">Proof Theory</a>, <script data-card-contents-for-ri="2392" type="text/json">{"id":2392,"name":"Proof Theory","url":"https://www.academia.edu/Documents/in/Proof_Theory?f_ri=2529","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2529" href="https://www.academia.edu/Documents/in/Logic_Programming">Logic Programming</a><script data-card-contents-for-ri="2529" type="text/json">{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5396567]'), work: {"id":5396567,"title":"Logical foundations of object-oriented and frame-based languages","created_at":"2013-12-11T19:14:27.171-08:00","url":"https://www.academia.edu/5396567/Logical_foundations_of_object_oriented_and_frame_based_languages?f_ri=2529","dom_id":"work_5396567","summary":null,"downloadable_attachments":[{"id":49308876,"asset_id":5396567,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":7528297,"first_name":"James","last_name":"Wu","domain_name":"independent","page_name":"JamesWu3","display_name":"James Wu","profile_url":"https://independent.academia.edu/JamesWu3?f_ri=2529","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming?f_ri=2529","nofollow":false},{"id":2349,"name":"Semantics","url":"https://www.academia.edu/Documents/in/Semantics?f_ri=2529","nofollow":false},{"id":2392,"name":"Proof Theory","url":"https://www.academia.edu/Documents/in/Proof_Theory?f_ri=2529","nofollow":false},{"id":2529,"name":"Logic Programming","url":"https://www.academia.edu/Documents/in/Logic_Programming?f_ri=2529","nofollow":false},{"id":3855,"name":"Polymorphism","url":"https://www.academia.edu/Documents/in/Polymorphism?f_ri=2529"},{"id":1121048,"name":"Object Oriented","url":"https://www.academia.edu/Documents/in/Object_Oriented?f_ri=2529"},{"id":1489478,"name":"Programming language","url":"https://www.academia.edu/Documents/in/Programming_language?f_ri=2529"},{"id":2294478,"name":"Deductive Databases","url":"https://www.academia.edu/Documents/in/Deductive_Databases?f_ri=2529"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Logic_Programming?after=50%2C5396567" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Logic_Programming?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Computational_Logic">Computational Logic</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2010">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2010">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Knowledge_Representation_and_Reasoning">Knowledge Representation and Reasoning</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="287095">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="287095">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Static_Analysis">Static Analysis</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2201">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2201">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Constraint_Programming">Constraint Programming</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="17874">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="17874">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Formal_Verification">Formal Verification</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="172035">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="172035">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Argumentation_Systems_Computer_Science_">Argumentation Systems (Computer Science)</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2532">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2532">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Functional_Programming">Functional Programming</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="454">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="454">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Belief_Revision_Computer_Science_">Belief Revision (Computer Science)</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="2531">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="2531">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="465">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="465">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Verification_Computer_Science_">Verification (Computer Science)</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="13892">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="13892">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Logic_Programming" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span   ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "fbd3318cb6989bc323f98fcd6dd27e991ea04a4cc3976e8fd3522dbec235c45b", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="loAVPNL8ujsw8so0jYWNIVw5+7CfPj95Mn9ck3URlK42Y9yCCCVJFn2BIu8QOC/9ElnDAKp4lc7LqZMuh876ig==" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Logic_Programming" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="2lz+X1g9jrQMsTYU8ez8pMLF9A1CqC0OKwo+ym9AHWB6vzfhguR9mUHC3s9sUV54jKXMvXfuh7nS3PF3nZ9zRA==" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a rel="nofollow" href="https://medium.com/academia">Blog</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2024</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>