[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"_public_publisher_all{\"sortAscending\":false,\"sortField\":\"updateTime\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"\"}":3,"_public_publisher_byId_b9c99dfe-b878-4a5b-81cf-0482f03f73fd":656,"_public_publication_all{\"sortAscending\":false,\"sortField\":\"totalCitation\",\"page\":0,\"size\":10,\"facet\":true,\"searchKey\":\"publisherId:b9c99dfe-b878-4a5b-81cf-0482f03f73fd,\"}":806},{"meta":4,"data":6},{"total":5},"117",[7,60,176,207,299,413,445,480,543,572],{"id":8,"createTime":9,"updateTime":10,"relativeEntities":11,"slug":12,"properties":13,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":29,"subjectFields":30,"manageAffiliations":31,"indexDatabases":32,"url":33,"thumbnailPath":34,"statistic":35,"gsStatistic":26,"type":26,"analyzePriority":26},"5a09599f-54d1-44c3-8f16-3847ac552024","2023-08-17T04:28:50.832+00:00","2025-10-13T23:58:52.517+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Truy%E1%BB%81n-nhi%E1%BB%85m-Vi%E1%BB%87t-Nam",{"country":14,"issn":16,"introduce":18,"title":21},{"VOID":15},"VN",{"VOID":17},"08667829",{"EN":19,"VI":20},"{\"ops\":[{\"insert\":\"Vietnam Journal of Infectious Diseases is a social - professional forum of the Vietnam Society for Infectious Diseases, whose responsibility is to introduce the researches, the scientific advances in Vietnam and from the world; to contribute to the improvement of knowledges for health care staffs about clinic, treatment, guideline, prevention, epidemiology for infectious diseases, HIV\u002FAIDS and community health care; to provide, exchange and publish scientific information to the public accurately and promptly.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Vietnam Journal of Infectious Diseases publishes in the whole country; serves the professional work for researchers, clinical staffs, administrators, undergraduate and postgraduate students who are working and studying in the infections, tropical diseases and HIV\u002FAIDS from central to local levels, also organizations and individuals in the world who are interested in infectious and tropical diseases and prevention for HIV\u002FAIDS.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Editor in Chief:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Kinh. - Chairman of Editorial Board\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Prof. Dr. Nguyen Van Mui.\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Headquarter:\"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Address:\"},{\"insert\":\" Level 6, National Hospital for Tropical Diseases, No. 78 Giai Phong Street, Dong Da District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tel:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913552672\"},\"insert\":\"0913552672\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"insert\":\".\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Bank account:\"},{\"insert\":\" 0021000275119, Vietcombank Hanoi Branch. Transaction office No. 7, 402 Tran Khat Chan, Hai Ba Trung District, Hanoi city, Vietnam.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Tạp chí Truyền nhiễm Việt Nam là cơ quan ngôn luận của Hội Truyền nhiễm Việt Nam, chịu sự lãnh đạo, chỉ đạo trực tiếp của Thường vụ Ban Chấp hành Hội Truyền nhiễm Việt Nam; sự kiểm tra, giám sát về nghiệp vụ báo chí của các cơ quan chức năng quản lý báo chí thuộc Bộ Thông tin và Truyền thông và Ban Tuyên giáo Trung ương Đảng.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí có trách nhiệm giới thiệu các công trình nghiên cứu khoa học, những tiến bộ khoa học trên thế giới và trong nước, góp phần nâng cao kiến thức khoa học cho cán bộ y tế về lâm sàng, điều trị, hướng dẫn, dự phòng, dịch tễ học các bệnh truyền nhiễm, HIV\u002FAIDS và chăm sóc sức khỏe cộng đồng; cung cấp, trao đổi, phổ biến các thông tin khoa học tới công chúng chính xác và kịp thời.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Tạp chí xuất bản 03 tháng\u002F01 kỳ và được phát hành qua Bưu điện và tự phát hành trong phạm vi toàn quốc.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Lãnh đạo Tạp chí: \"},{\"attributes\":{\"header\":4},\"insert\":\"\\n\"},{\"insert\":\"Tổng Biên tập: ThS.BSCKII Nguyễn Trung Cấp\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"Phó Tổng Biên tập:\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"insert\":\"            TS.BSCKII Phạm Ngọc Thạch\"},{\"attributes\":{\"align\":\"justify\",\"blockquote\":true},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Trụ sở tòa soạn:\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Địa chỉ: Tầng 6, Bệnh viện Bệnh Nhiệt đới Trung ương, 78 đường Giải Phóng, phường Phương Mai, quận Đống Đa, thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Điện thoại:\"},{\"insert\":\" \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:02435765464\"},\"insert\":\"02435765464\"},{\"insert\":\" - \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Ftel:0913228072\"},\"insert\":\"0913228072\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Email\"},{\"insert\":\": \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Findex\u002Fadmin\u002Fcontexts\u002Fmailto:tungphamvan52@gmail.com\"},\"insert\":\"tungphamvan52@gmail.com\"},{\"insert\":\"; \"},{\"attributes\":{\"color\":\"#008d45\",\"background\":\"transparent\",\"link\":\"https:\u002F\u002Fbvnd.vojs.vn\u002Findex.php\u002Fvjid\u002Fmanagement\u002Fsettings\u002Fcontext\u002Fmailto:tapchitruyennhiem@gmail.com\"},\"insert\":\"tapchitruyennhiem@gmail.com\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Tài khoản:\"},{\"insert\":\" Số 0021000275119 Ngân hàng Ngoại thương Việt Nam, chi nhánh Hà Nội (Vietcombank Hà Nội). Phòng giao dịch số 7, 402 Trần Khát Chân, quận Hai Bà Trưng, Thành phố Hà Nội.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":22,"VI":23},"Vietnam Journal of Infectious Diseases","Tạp chí Truyền nhiễm Việt Nam","PUBLISHER","VERIFIED",null,"Admin update database","PENDING",51,[],[],[],"https:\u002F\u002Ftruyennhiemvietnam.vn\u002Findex.php\u002Fvjid","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F5a09599f-54d1-44c3-8f16-3847ac552024\u002Fadb0e52bf25e0de580fd4289519cb8bf.jpg",{"impactFactor":36,"impactFactorByYear":37,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":41,"totalPublicationByYear":42,"totalCitation":48,"totalCitationByYear":49,"totalCitationPerPublication":54,"totalCitationPerPublicationByYear":55,"hindexLast5Year":59,"hindex":59},0,{"2022":38,"2023":39,"2024":40},0.01,0.03,0.13,315,{"2020":43,"2021":44,"2022":45,"2023":46,"2024":47},63,58,57,65,72,43,{"2020":50,"2021":51,"2022":52,"2023":53},8,15,9,11,0.14,{"2020":40,"2021":56,"2022":57,"2023":58},0.26,0.16,0.17,3,{"id":61,"createTime":62,"updateTime":63,"relativeEntities":64,"slug":65,"properties":66,"entityType":24,"verifyStatus":25,"verifyTime":78,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":79,"subjectFields":80,"manageAffiliations":81,"indexDatabases":136,"url":137,"thumbnailPath":26,"statistic":138,"gsStatistic":155,"type":175,"analyzePriority":26},"25b6bd10-676c-40c0-8dc3-356d1679a284","2023-05-19T02:22:33.430+00:00","2026-06-18T23:33:57.141+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Y-D%C6%B0%E1%BB%A3c-h%E1%BB%8Dc-C%E1%BA%A7n-Th%C6%A1",{"country":67,"issn":68,"introduce":70,"title":73,"gsId":76},{"VOID":15},{"VOID":69},"23541210",{"EN":71,"VI":72},"\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">04\u002F10\u002F2015 Ministry of Information and Communications allowed Can Tho journal of medicine and pharmacy to operate (102 \u002FGP-BTTTT)\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">07\u002F16\u002F2015 Can Tho journal of medicine and pharmacy is internationally recognized: ISSN 2354-1210\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">In 2016, The journal has been included in the list of medical science journals by The State Council for professorship which is awarded a work score of 0-0.5 points for a published article.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Can Tho Journal of Medicine and Pharmacy welcome original works that haven’t been submitted or published in other medical journals. Posts must contain content related to one of the journal’s categories.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The content published\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The journal is divided into 3 categories:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Scientific research article: are valuable scientific works, which have been researched and accepted.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Overview of medicine, biology and pharmacy: serving the objective of continuing training in the fields of medicine, biology and pharmacy; to systematize classical and modern knowledge.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Update information on new knowledge about medicine, biology, pharmacy in the country and in the world.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Scope\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Publication and introduction of scientific research in the fields:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Medicine (internal medicine, surgery, pediatrics, obstetrics and gynecology, odonto-stomatology, laboratory, oncology, traditional medicine, nursing).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Biology (genetics, biotechnology).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">+ Pharmacology (pharmaceutics, drug quality analysis-control, synthetic pharmaceutical chemistry, biochemistry, pharmacognosy, botany, clinical pharmacy).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- To enhance the quality of undergraduate, postgraduate education, scientifically researching and meet the necessary treatment in hospital.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Introducing the updated domestic and oversea information about science technology to promote scientific research and exchanging technology in local, other universities.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">- Exchanging pharmaceutical and medical information for social health developing in the Mekong Delta and Vietnam.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">The object\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Postgraduate students, student of Can Tho University of Medicine and Pharmacy, scientists from schools, research institutes, hospitals, health centers, pharmaceutical companies of the Mekong Delta; other provinces and regions in Vietnam and other country.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Address\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Headquarters of Can Tho Journal of Medicine and Pharmacy, located Scientific Research and International Cooperation Office: 179 Nguyen Van Cu Street, An Khanh Ward, Ninh Kieu District, Can Tho City, Vietnam.\u003C\u002Fspan>\u003C\u002Fp>","\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Ngày 16\u002F7\u002F2015, Tạp chí Y Dược học Cần Thơ được cấp chỉ số quốc tế: ISSN 2354-1210.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 4\u002F2016, Tạp chí đã được Hội đồng Giáo sư ngành Y đưa vào danh sách các tạp chí khoa học Y học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Năm 2020 Tạp chí Y Dược học Cần Thơ đã được phê duyệt vào danh mục của các Hội đồng Giáo sư ngành Dược học được tính điểm công trình 0-0,5 điểm cho một bài báo đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ ra 12 số\u002Fnăm, 180-200 trang\u002Fsố.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Từ tháng 12\u002F2022 Tạp chí Y Dược học Cần Thơ là thành viên của hệ thống Crossref và từ tháng 01\u002F2023 tạp chí thực hiện bình duyệt online kín 2 chiều nhằm tăng tính minh bạch, tin cậy của các công trình nghiên cứu khoa học và đảm bảo tốt nhất chất lượng khoa học của bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ, mục đích và phạm vi của tạp chí\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tôn chỉ và mục đích hoạt động của tạp chí: xuất bản nhằm mục đích phổ biến kết quả từ các đề tài nghiên cứu khoa học; giao lưu trao đổi khoa học, chia sẻ kinh nghiệm, học tập, đồng thời cập nhật thông tin khoa học mới trong các lĩnh vực y, sinh, dược học trong và ngoài nước.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phạm vi của tạp chí: Tạp chí xuất bản được chia thành 3 chuyên mục: (i) Bài báo nghiên cứu khoa học là kết quả công trình nghiên cứu khoa học có giá trị đã được triển khai nghiên cứu, (ii) Bài tổng quan y, sinh, dược học: phục vụ mục tiêu đào tạo liên tục trong lĩnh vực y, sinh, dược học; nhằm hệ thống hóa những kiến thức kinh điển và hiện đại; (iii) Thông tin cập nhật kiến thức mới về y, sinh, dược học trong nước và trên thế giới.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Chính sách truy cập mở\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ áp dụng chính sách truy cập mở đối với các bài báo đã xuất bản đến với độc giả, nhằm mở rộng cơ hội tiếp cận các kết quả nghiên cứu chất lượng cao và tăng cường trao đổi kiến thức. Tạp chí đăng tải trực tuyến (miễn phí) toàn văn các bài báo được công bố trên website của Tạp chí (https:\u002F\u002Ftapchi.ctump.edu.vn).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đạo đức xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ cam kết tuân thủ đạo đức xuất bản phù hợp với các hướng dẫn và tiêu chuẩn của the Committee on Publication Ethics (COPE), tuân thủ các nguyên tắc của COPE’s Core Practices, Best Practices Guidelines for Journal Editors và Guidelines on Good Publication Practices.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Bản thảo bài báo chỉ được chấp nhận khi được tác giả chịu trách nhiệm chính cam kết các nội dung sau: Các nội dung của bản thảo chưa được đăng tải toàn bộ hoặc một phần ở các tạp chí khác; Tất cả các tác giả đều có đóng góp một cách đáng kể vào quá trình nghiên cứu hoặc chuẩn bị bản thảo và cùng chịu trách nhiệm về các nội dung của bản thảo; Tuân thủ các biện pháp đảm bảo đạo đức nghiên cứu (ví dụ thỏa thuận đồng ý tham gia nghiên cứu).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Cam kết bảo mật\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí cam kết thực hiện và tuân thủ các quy định của luật và các văn bản hướng dẫn liên quan đến bảo mật thông tin cá nhân trên không gian mạng. Các thông tin mà người dùng (tác giả, độc giả, biên tập viên, người phản biện) nhập vào các biểu mẫu trên Hệ thống Quản lý xuất bản trực tuyến của tạp chí chỉ được sử dụng vào các mục đích đã được tuyên bố rõ ràng và sẽ không được cung cấp cho bất kỳ bên thứ ba nào khác, hay dùng vào bất kỳ mục đích nào khác.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Phí gửi bài\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng bài: 1.000.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Lệ phí gửi đăng nhanh: 1.500.000đ\u002Fbài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với tác giả là cán bộ viên chức thuộc Trường Đại học Y Dược Cần Thơ thì được hỗ trợ 50% lệ phí gửi đăng bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Đối với sinh viên thực hiện đề tài nghiên cứu khoa học cấp trường được hỗ trợ 100% lệ phí đăng bài ( Tác giả gửi đính kèm “ Quyết định về việc giao tổ chức thực hiện đề tài nghiên cứu khoa học cấp Trường của sinh viên”).\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Hình thức nộp lệ phí:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Tiền mặt:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Nộp trực tiếp tại Phòng Tài chính - Kế toán, Trường Đại học Y Dược Cần Thơ, số 179 Nguyễn Văn Cừ, P. An Khánh, Q. Ninh Kiều, thành phố Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Chuyển khoản:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tên Tài khoản: Trường ĐHYD Cần Thơ, Số TK: 0111000115668, tại ngân hàng Vietcombank chi nhánh Cần Thơ.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Thời gian: Áp dụng từ ngày 01\u002F02\u002F2023.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">* Phí gửi bài không được hoàn trả khi bài viết bị từ chối hoặc tác giả xin rút bài viết.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Quy trình phản biện bài báo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tạp chí Y Dược học Cần Thơ thực hiện quy trình phản biện kín hai chiều nghiêm ngặt. Danh tính của những người phản biện không được tiết lộ cho các tác giả và ngược lại. Quy trình thẩm định bài báo đăng gồm các bước sau:\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tiếp nhận bản thảo\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Tác giả liên hệ gửi bản thảo đến Tạp chí qua hệ thống trực tuyến tại website: https:\u002F\u002Ftapchi.ctump.edu.vn. Hướng dẫn về cách đăng ký, gửi bài và chuẩn bị bản thảo được cung cấp trên website của Tạp chí.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sàng lọc sơ bộ\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Sau khi Tòa soạn nhận được bài báo của tác giả, Ban Thư ký sẽ tiến hành kiểm tra sơ bộ bài báo (các yêu cầu về nội dung và hình thức). Những bài báo không đúng quy cách hoặc có nội dung không phù hợp hoặc vi phạm bản quyền sẽ bị từ chối (Ban Thư ký thông báo phản hồi đến tác giả trong vòng 1 tuần). Những bài báo đủ điều kiện, được Ban Thư ký tòa soạn chuyển đến Ban Biên tập có cùng chuyên môn với nội dung bài báo để đề xuất người phản biện. Thời gian kể từ khi Ban Biên tập nhận bài báo đến khi đề xuất người phản biện bài báo chậm nhất là 5 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Vòng phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký gửi bài và yêu cầu phản biện đến 02 phản biện độc lập.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Các phản biện gởi nhận xét cho Ban Thư ký. Thời gian từ khi gửi bài cho phản biện đến khi nhận ý kiến của phản biện tối đa là 20 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xử ký kết quả phản biện\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Nếu ý kiến đồng ý cho đăng và không cần chỉnh sửa, Ban Thư ký tiếp tục đăng bài theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Nếu ý kiến đồng ý đăng và cần chỉnh sửa, Ban Thư ký sẽ thông tin đến tác giả chỉnh sửa theo yêu cầu của người phản biện. Thời gian chỉnh sửa và gửi lại kéo dài không quá 2 tuần, từ khi tác giả bài báo nhận được thông tin (Quá trình này có thể lặp lại tối đa 2 lần\u002F1 bài báo). Khi có sự thống nhất, đồng ý của người phản biện; bài báo được tiếp tục đăng theo qui trình.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Những bài báo có chất lượng không đạt yêu cầu, cả 2 phản biện không đồng ý cho đăng sẽ bị Tòa soạn từ chối đăng.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">Xuất bản\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">1. Ban Thư ký tổng hợp các bản thảo đã được tác giả hoàn thiện sau thẩm định trình Ban Biên tập xem xét, Tổng Biên tập phê duyệt, quyết định bài đăng theo các tiêu chí: sự phù hợp nội dung với tôn chỉ và mục đích, thể loại bài viết (ưu tiên các bài có bài có nghiên cứu chuyên sâu, hàm lượng khoa học cao), đóng góp mới bài báo, bài báo được ưu tiên đăng trong số gần nhất của Tạp chí theo thứ tự: tính thời sự, chất lượng bài báo và thời gian gửi bài.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">2. Ban Biên tập và Ban Thư ký biên tập bản thảo, chế bản, đọc rà soát lỗi. Thời gian hoàn thành từ 10-15 ngày.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">3. Ban Thư ký có trách nhiệm thông báo cho tác giả bài báo (bằng e-mail) về tình hình phê duyệt bài báo, thời gian, số kỳ, tập xuất bản bài báo theo qui định.\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>\u003Cp>\u003Cspan style=\"color: rgb(0, 0, 0);\">4. Danh sách bài báo theo số Tạp chí được in ấn và phát hành trong năm định kỳ được công bố chính thức trên website: https:\u002F\u002Ftapchi.ctump.edu.vn\u003C\u002Fspan>\u003C\u002Fp>\u003Cp>\u003Cbr>\u003C\u002Fp>",{"EN":74,"VI":75},"Cantho Journal of Medicine and Pharmacy","Tạp chí Y Dược học Cần Thơ",{"VOID":77},"wcQ1uqwAAAAJ","2023-05-30T08:17:21.868+00:00",32,[],[82],{"id":83,"createTime":84,"updateTime":85,"relativeEntities":86,"slug":87,"properties":88,"entityType":98,"verifyStatus":25,"verifyTime":99,"verifyNote":26,"syncStatus":28,"languages":100,"translateLanguages":26,"viewCount":103,"url":104,"parentIds":105,"statistic":106},"6413896b-eca9-442b-a73f-182a58a0ce40","2023-06-12T14:59:13.446+00:00","2026-06-19T02:29:32.871+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Y-D%C6%B0%E1%BB%A3c-C%E1%BA%A7n-Th%C6%A1",{"country":89,"title":90,"address":93,"abbreviation":96},{"VOID":15},{"EN":91,"VI":92},"Can Tho University of Medicine and Pharmacy","Trường Đại học Y Dược Cần Thơ",{"VI":94,"EN":95},"Số 179, đường Nguyễn Văn Cừ, phường An Khánh, quận Ninh Kiều, thành phố Cần Thơ, Việt Nam","No 179, Nguyen Van Cu street, An Khanh ward, Ninh Kieu district, Can Tho city, Vietnam",{"VOID":97},"ctump","AFFILIATION","2023-08-01T14:07:27.977+00:00",[101,102],"VI","EN",12,"http:\u002F\u002Fwww.ctump.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":107,"i10Index":111,"i10IndexLast5Year":59,"totalPublication":112,"totalPublicationByYear":113,"totalCitation":122,"totalCitationByYear":123,"totalCitationPerPublication":128,"totalCitationPerPublicationByYear":129,"hindexLast5Year":135,"hindex":135},{"2022":108,"2023":109,"2024":110,"2025":38},0.1,0.05,0.07,4,1489,{"2013":114,"2014":115,"2015":115,"2016":111,"2017":115,"2018":59,"2019":114,"2020":116,"2021":117,"2022":118,"2023":119,"2024":120,"2025":121,"2026":111},2,1,10,84,281,680,260,156,313,{"2013":59,"2014":114,"2018":124,"2021":125,"2022":126,"2023":127},17,36,123,132,0.21,{"2013":130,"2014":114,"2018":131,"2021":132,"2022":133,"2023":134},1.5,5.67,0.43,0.44,0.19,6,[],"https:\u002F\u002Ftapchi.ctump.edu.vn\u002Findex.php\u002Fctump",{"impactFactor":36,"impactFactorByYear":139,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":140,"totalPublicationByYear":141,"totalCitation":147,"totalCitationByYear":148,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":152,"hindexLast5Year":135,"hindex":135},{"2022":38,"2023":36,"2024":39,"2025":38},1956,{"0":114,"2019":114,"2020":50,"2021":142,"2022":143,"2023":144,"2024":145,"2025":146},76,403,789,305,371,524,{"0":114,"2019":135,"2021":124,"2022":149,"2023":150,"2024":111,"2025":114},287,206,0.27,{"0":115,"2019":59,"2021":153,"2022":154,"2023":56,"2024":38,"2025":38},0.22,0.71,{"impactFactor":26,"impactFactorByYear":26,"i10Index":114,"i10IndexLast5Year":114,"totalPublication":156,"totalPublicationByYear":157,"totalCitation":163,"totalCitationByYear":164,"totalCitationPerPublication":169,"totalCitationPerPublicationByYear":170,"hindexLast5Year":135,"hindex":135},461,{"0":158,"2019":114,"2021":159,"2022":160,"2023":161,"2024":158,"2025":162},7,37,296,107,5,419,{"2021":59,"2022":59,"2023":165,"2024":166,"2025":167,"2026":168},71,126,171,41,0.91,{"2021":171,"2022":38,"2023":172,"2024":173,"2025":174},0.08,0.66,18,34.2,"JOURNAL",{"id":177,"createTime":178,"updateTime":179,"relativeEntities":180,"slug":181,"properties":182,"entityType":24,"verifyStatus":25,"verifyTime":193,"verifyNote":26,"syncStatus":28,"languages":194,"translateLanguages":26,"viewCount":36,"subjectFields":195,"manageAffiliations":196,"indexDatabases":197,"url":198,"thumbnailPath":26,"statistic":26,"gsStatistic":199,"type":175,"analyzePriority":26},"f8d0bf97-8d89-482e-b58c-2fc481a0b79b","2025-10-27T06:27:08.591+00:00","2026-06-18T23:33:41.667+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-v%C3%A0-C%C3%B4ng-ngh%E1%BB%87-nhi%E1%BB%87t-%C4%91%E1%BB%9Bi",{"country":183,"introduce":184,"gsId":186,"title":188,"issn":191},{"VOID":15},{"EN":185},"\u003Cp style=\"text-align:justify;\">     Journal of Tropical Science and Engineering (JTSE) is a multidisciplinary scientific journal, licensed to operate as a print journal in 2012 and an electronic journal in 2024 (License No.1479\u002FGP-BTTTT dated August 20, 2012 and No.91\u002FGP-BTTTT dated April 9, 2024 issued by the Ministry of Information and Communications of Vietnam). The JTSE is headquartered in Hanoi.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">        The JTSE is published every 3 months (4 issues\u002Fyear), publishing research results and overview articles in 3 groups of fields: Tropical Ecology and Environment; Chemistry and Material Sciences; Biomedicine and Pharmacy. In 2022, the JTSE registered the international identifier Digital Object Identifier (DOI): 10.58334\u002Fvrtc.jtst and assigned DOI codes to all articles of the journal. The members of the Editorial Board of the JTSE are prestigious scientists and leading scientists from Vietnam and many countries in the world. The JTSE has been recognized by the Vietnam State Council for Professorship to score scientific articles in Chemistry, Medicine and Biology with scores ranging from 0-0.75 points.\u003C\u002Fp>\u003Cp style=\"text-align:justify;\">      Currently, the JTSE is building and perfecting a set of criteria and making efforts to join the List of prestigious  international journals with a roadmap to enter Scopus and SCIE in the coming time.\u003C\u002Fp>",{"VOID":187},"MS2_GJQAAAAJ",{"VI":189,"EN":190},"Tạp chí Khoa học và Công nghệ nhiệt đới","Journal of Tropical Science and Engineering",{"VOID":192},"08667535","2025-10-27T06:27:25.058+00:00",[101,102],[],[],[],"https:\u002F\u002Ftapchikhcnnd.com.vn",{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":200,"totalPublicationByYear":201,"totalCitation":161,"totalCitationByYear":203,"totalCitationPerPublication":153,"totalCitationPerPublicationByYear":205,"hindexLast5Year":114,"hindex":114},481,{"0":115,"2020":115,"2021":115,"2022":114,"2024":115,"2025":202,"2026":115},474,{"2017":114,"2018":115,"2019":111,"2020":162,"2021":162,"2022":116,"2023":50,"2024":162,"2025":204,"2026":52},52,{"2020":162,"2021":162,"2022":162,"2024":162,"2025":206,"2026":52},0.11,{"id":208,"createTime":209,"updateTime":210,"relativeEntities":211,"slug":212,"properties":213,"entityType":24,"verifyStatus":25,"verifyTime":221,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"subjectFields":223,"manageAffiliations":224,"indexDatabases":225,"url":226,"thumbnailPath":26,"statistic":227,"gsStatistic":276,"type":175,"analyzePriority":26},"a3d1e82a-57e2-40f9-940e-f5fa8b9ef64a","2023-06-01T07:11:26.039+00:00","2026-06-18T23:33:28.573+00:00",[],"VNU-Journal-of-Science-Earth-and-Environmental-Sciences",{"issn":214,"title":216,"country":218,"gsId":219},{"VOID":215},"26159279",{"EN":217},"VNU Journal of Science: Earth and Environmental Sciences",{"VOID":15},{"VOID":220},"UmXD8vEAAAAJ","2023-06-01T07:17:59.210+00:00",27,[],[],[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FEES",{"impactFactor":36,"impactFactorByYear":228,"i10Index":234,"i10IndexLast5Year":36,"totalPublication":235,"totalPublicationByYear":236,"totalCitation":246,"totalCitationByYear":247,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":262,"hindexLast5Year":103,"hindex":103},{"2010":229,"2012":40,"2013":230,"2014":230,"2015":231,"2016":54,"2017":171,"2018":109,"2019":110,"2020":57,"2021":232,"2022":233,"2023":151,"2024":58},0.02,0.04,0.09,0.31,0.4,19,656,{"2008":237,"2009":238,"2010":239,"2011":238,"2012":240,"2013":241,"2014":239,"2015":242,"2016":243,"2017":244,"2018":245,"2019":165,"2020":125,"2021":168,"2022":125,"2023":222,"2024":111},23,24,22,28,25,20,146,29,78,1038,{"2008":248,"2009":249,"2010":250,"2011":251,"2012":252,"2013":253,"2014":254,"2015":255,"2016":256,"2017":257,"2018":161,"2019":258,"2020":259,"2021":29,"2022":260},119,64,66,86,38,73,59,31,129,39,97,53,26,1.58,{"2008":263,"2009":264,"2010":59,"2011":265,"2012":266,"2013":267,"2014":268,"2015":269,"2016":270,"2017":271,"2018":272,"2019":272,"2020":273,"2021":274,"2022":275},5.17,2.67,3.58,1.36,2.92,2.68,1.55,0.88,1.34,1.37,1.47,1.24,0.72,{"impactFactor":26,"impactFactorByYear":26,"i10Index":173,"i10IndexLast5Year":135,"totalPublication":277,"totalPublicationByYear":278,"totalCitation":279,"totalCitationByYear":280,"totalCitationPerPublication":288,"totalCitationPerPublicationByYear":289,"hindexLast5Year":158,"hindex":298},113,{"2007":114,"2008":103,"2009":173,"2010":116,"2011":51,"2012":239,"2013":103,"2014":162,"2015":53,"2016":135},616,{"2009":162,"2010":114,"2011":52,"2012":124,"2013":222,"2014":255,"2015":48,"2016":44,"2017":281,"2018":282,"2019":259,"2020":283,"2021":284,"2022":285,"2023":286,"2024":257,"2025":287,"2026":59},54,60,49,47,34,44,33,5.45,{"2009":290,"2010":291,"2011":292,"2012":293,"2013":294,"2014":295,"2015":296,"2016":297},0.28,0.2,0.6,0.77,2.25,6.2,3.91,9.67,14,{"id":300,"createTime":301,"updateTime":302,"relativeEntities":303,"slug":304,"properties":305,"entityType":24,"verifyStatus":25,"verifyTime":316,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":234,"subjectFields":317,"manageAffiliations":318,"indexDatabases":388,"url":389,"thumbnailPath":390,"statistic":391,"gsStatistic":409,"type":175,"analyzePriority":26},"a7166325-6c9e-4db3-8a59-7c879701a372","2023-07-31T04:28:49.231+00:00","2026-06-18T23:33:22.428+00:00",[],"VNU-Journal-of-Science-Policy-and-Management-Studies",{"country":306,"issn":307,"eissn":309,"title":311,"gsId":314},{"VOID":15},{"VOID":308},"26159295",{"VOID":310},"25881116",{"EN":312,"VI":313},"VNU Journal of Science: Policy and Management Studies","Tạp chí Nghiên cứu Chính sách và Quản lý",{"VOID":315},"xKW2E_cAAAAJ","2023-08-01T03:23:46.688+00:00",[],[319],{"id":320,"createTime":321,"updateTime":322,"relativeEntities":323,"slug":324,"properties":325,"entityType":98,"verifyStatus":25,"verifyTime":335,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":336,"url":337,"parentIds":338,"statistic":339},"12466116-8f60-4b01-8faf-2411483a0977","2023-05-30T09:37:38.472+00:00","2026-06-19T02:14:28.352+00:00",[],"Vietnam-National-University",{"country":326,"title":327,"abbreviation":330,"address":332},{"VOID":15},{"EN":328,"VI":329},"Vietnam National University, Hanoi","Đại học Quốc gia Hà Nội",{"VOID":331},"VNU",{"VI":333,"EN":334},"Số 144 Xuân Thủy, Phường Dịch Vọng Hậu, Quận Cầu Giấy, Hà Nội, Việt Nam","No. 144 Xuan Thuy Street, Dich Vong Hau Ward, Cau Giay District, Hanoi, Vietnam","2023-08-02T13:58:17.029+00:00",16,"http:\u002F\u002Fwww.vnu.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":340,"i10Index":285,"i10IndexLast5Year":162,"totalPublication":344,"totalPublicationByYear":345,"totalCitation":354,"totalCitationByYear":355,"totalCitationPerPublication":368,"totalCitationPerPublicationByYear":369,"hindexLast5Year":336,"hindex":336},{"2014":109,"2015":231,"2016":231,"2017":206,"2018":341,"2019":110,"2020":342,"2021":343,"2022":171,"2023":231,"2024":110,"2025":39},0.06,0.18,0.35,1247,{"2003":115,"2004":115,"2005":114,"2006":59,"2007":111,"2008":162,"2009":59,"2010":50,"2011":124,"2012":336,"2013":260,"2014":244,"2015":250,"2016":281,"2017":346,"2018":347,"2019":348,"2020":349,"2021":350,"2022":351,"2023":352,"2024":353,"2025":255,"2026":50},94,88,83,67,176,185,187,93,1644,{"2004":111,"2005":115,"2006":52,"2007":298,"2008":356,"2009":298,"2010":286,"2011":357,"2012":244,"2013":358,"2014":359,"2015":360,"2016":361,"2017":362,"2018":363,"2019":364,"2020":365,"2021":366,"2022":367,"2023":367,"2024":162},13,81,48,70,151,115,109,259,174,181,121,101,1.32,{"2004":111,"2005":370,"2006":59,"2007":371,"2008":372,"2009":373,"2010":374,"2011":375,"2012":376,"2013":377,"2014":378,"2015":379,"2016":380,"2017":381,"2018":382,"2019":383,"2020":384,"2021":385,"2022":386,"2023":387,"2024":109},0.5,3.5,2.6,4.67,5.5,4.76,1.81,1.85,2.41,2.29,2.13,1.16,2.94,2.1,2.7,0.69,0.55,0.54,[],"https:\u002F\u002Fjs.vnu.edu.vn\u002FPaM","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002Fa7166325-6c9e-4db3-8a59-7c879701a372\u002Fecfe83f4bcc60c7023ae04d8900fe0ac.jpg",{"impactFactor":36,"impactFactorByYear":392,"i10Index":111,"i10IndexLast5Year":36,"totalPublication":394,"totalPublicationByYear":395,"totalCitation":399,"totalCitationByYear":400,"totalCitationPerPublication":293,"totalCitationPerPublicationByYear":403,"hindexLast5Year":158,"hindex":158},{"2018":109,"2019":171,"2020":393,"2021":108,"2022":54,"2023":206,"2024":54},0.23,320,{"2015":50,"2016":239,"2017":286,"2018":396,"2019":397,"2020":159,"2021":398,"2022":168,"2023":79,"2024":255},30,35,40,247,{"2015":115,"2016":242,"2017":401,"2018":222,"2019":402,"2020":79,"2021":239,"2022":50,"2023":116},77,50,{"2015":404,"2016":169,"2017":405,"2018":406,"2019":407,"2020":408,"2021":386,"2022":291,"2023":232},0.12,1.75,0.9,1.43,0.86,{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":103,"totalPublicationByYear":410,"totalCitation":234,"totalCitationByYear":411,"totalCitationPerPublication":261,"totalCitationPerPublicationByYear":412,"hindexLast5Year":114,"hindex":59},{"2015":114,"2016":116},{"2016":115,"2017":114,"2018":114,"2019":59,"2020":114,"2021":59,"2022":114,"2023":114,"2024":115,"2026":115},{"2016":108},{"id":414,"createTime":415,"updateTime":416,"relativeEntities":417,"slug":418,"properties":419,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":238,"subjectFields":428,"manageAffiliations":429,"indexDatabases":430,"url":431,"thumbnailPath":26,"statistic":432,"gsStatistic":438,"type":175,"analyzePriority":26},"16e65a3f-d274-47dd-8691-56d76eb58c3d","2023-05-30T09:10:06.062+00:00","2026-06-18T23:33:17.679+00:00",[],"Vietnam-Journal-of-Otorhinolaryngology-Head-and-Neck-Surgery",{"country":420,"issn":421,"title":423,"gsId":426},{"VOID":15},{"VOID":422},"18593704",{"EN":424,"VI":425},"Vietnam Journal of Otorhinolaryngology - Head and Neck Surgery","Tạp chí Tai Mũi Họng Việt Nam",{"VOID":427},"L78B_eIAAAAJ",[],[],[],"https:\u002F\u002Ftapchitaimuihong.vn\u002Findex.php\u002Ftmh",{"impactFactor":36,"impactFactorByYear":433,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":434,"totalPublicationByYear":435,"totalCitation":111,"totalCitationByYear":436,"totalCitationPerPublication":230,"totalCitationPerPublicationByYear":437,"hindexLast5Year":115,"hindex":115},{"2024":229},95,{"2022":52,"2023":286,"2024":255,"2025":53},{"2023":111},{"2023":231},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":240,"totalPublicationByYear":439,"totalCitation":234,"totalCitationByYear":440,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":442,"hindexLast5Year":114,"hindex":114},{"2023":53,"2024":116,"2025":135,"2026":115},{"2024":59,"2025":298,"2026":114},0.68,{"2024":443,"2025":444,"2026":114},0.3,2.33,{"id":446,"createTime":447,"updateTime":448,"relativeEntities":449,"slug":450,"properties":451,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":396,"subjectFields":460,"manageAffiliations":461,"indexDatabases":462,"url":463,"thumbnailPath":464,"statistic":465,"gsStatistic":472,"type":175,"analyzePriority":26},"25988add-c322-4eda-afda-63b1559bb824","2023-04-07T03:49:55.817+00:00","2026-06-18T23:32:23.776+00:00",[],"T%E1%BA%A1p%20ch%C3%AD%20Y%20-%20D%C6%B0%E1%BB%A3c%20h%E1%BB%8Dc%20qu%C3%A2n%20s%E1%BB%B1",{"country":452,"issn":453,"title":455,"gsId":458},{"VOID":15},{"VOID":454},"18590748",{"EN":456,"VI":457},"Journal of Military Pharmaco-medicine","Tạp chí Y - Dược học quân sự",{"VOID":459},"_pmQ8IEAAAAJ",[],[],[],"https:\u002F\u002Fjmpm.vn\u002Findex.php\u002Fjmpm","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F25988add-c322-4eda-afda-63b1559bb824\u002F09c6bc42157cf5ece95edc971ccddb52.jpg",{"impactFactor":36,"impactFactorByYear":466,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":467,"totalPublicationByYear":468,"totalCitation":135,"totalCitationByYear":470,"totalCitationPerPublication":38,"totalCitationPerPublicationByYear":471,"hindexLast5Year":115,"hindex":115},{"2023":229,"2024":38},475,{"2022":168,"2023":365,"2024":469,"2025":124},236,{"2022":114,"2023":111},{"2022":109,"2023":229},{"impactFactor":26,"impactFactorByYear":26,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":277,"totalPublicationByYear":473,"totalCitation":401,"totalCitationByYear":474,"totalCitationPerPublication":441,"totalCitationPerPublicationByYear":475,"hindexLast5Year":59,"hindex":59},{"2015":115,"2018":114,"2019":115,"2020":115,"2021":59,"2022":103,"2023":159,"2024":287,"2025":237},{"2020":115,"2021":115,"2022":115,"2023":52,"2024":237,"2025":79,"2026":116},{"2020":115,"2021":476,"2022":171,"2023":477,"2024":478,"2025":479},0.33,0.24,0.7,1.39,{"id":481,"createTime":482,"updateTime":483,"relativeEntities":484,"slug":485,"properties":486,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":496,"translateLanguages":26,"viewCount":45,"subjectFields":497,"manageAffiliations":498,"indexDatabases":525,"url":526,"thumbnailPath":527,"statistic":528,"gsStatistic":26,"type":26,"analyzePriority":26},"2b8d7b12-2d20-4777-be98-077f44f03c69","2023-09-07T07:40:58.286+00:00","2025-07-13T21:21:00.542+00:00",[],"VNU-Journal-of-Social-Sciences-and-Humanities",{"country":487,"issn":488,"introduce":490,"title":493},{"VOID":15},{"VOID":489},"23541172",{"EN":491,"VI":492},"{\"ops\":[{\"insert\":\"VNU Journal of Social Sciences and Humanities (ISSN 2354-1172) is a double-blind peer-reviewed journal published by University of Social Sciences and Humanities, Vietnam National University, Hanoi, Vietnam, under the publication permit no. 155\u002FGP-BTTTT, issued on 11\"},{\"attributes\":{\"script\":\"super\"},\"insert\":\"th \"},{\"insert\":\"May, 2015 by Ministry of Information and Communications. The journal publishes four Vietnamese issues and two English issues per year.\\nCurrently, there are 35 reputable professors in the editorial board. The main objectives of the journal include: providing an intellectual platform for Vietnamese and international scholars; promoting interdisciplinary studies in social sciences and humanities; becoming the leading journal in social sciences and humanities in Vietnam; being indexed by worldwide databases and having academic recognition internationally in the near future.\\nThe journal is currently indexed by Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services and Vietnam National University’s digital archive.\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Journal of Social Sciences and Humanities-Vietnam\"},{\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"ISSN 2354-1172, email: tapchikhxhnv@gmail.com, tckhxhnv@vnu.edu.vn\"},{\"insert\":\"\\n\"}]}","{\"ops\":[{\"insert\":\"Được thành lập ngày 31\u002F8\u002F2015 (giấy phép hoạt động số 155\u002FGP-BVHTT ngày 11 tháng 5 năm 2015 của Bộ Thông tin và Truyền thông, mã số tiêu chuẩn quốc tế ISSN 2354-1172), Tạp chí Khoa học Xã hội và Nhân văn (Journal of Social Sciences and Humanities) là ấn phẩm khoa học chính thức, duy nhất của Trường Đại học Khoa học Xã hội và Nhân văn, ĐHQG Hà Nội, phát triển và kế thừa Chuyên san Khoa học Xã hội và Nhân văn, Tạp chí Khoa học, ĐHQG Hà Nội.\\nTạp chí xuất bản định kỳ (04 số tiếng Việt\u002Fnăm và 02 số tiếng Anh\u002Fnăm), có nhiệm vụ \"},{\"attributes\":{\"italic\":true},\"insert\":\"công bố, giới thiệu các công trình nghiên cứu khoa học khoa học xã hội và nhân văn của các tác giả là các nhà khoa học trong và ngoài nước, phục vụ giảng dạy, học tập và nghiên cứu khoa học\"},{\"insert\":\". Hội đồng biên tập của Tạp chí hiện bao gồm 33 nhà khoa học có uy tín trong nước và quốc tế. Tạp chí tập trung và ưu tiên đăng tải những bài báo theo định hướng của tinh thần cởi mở, sáng tạo, nhanh chóng vươn lên để tiếp cận và sánh ngang với các tạp chí có uy tín hàng đầu của khu vực và trên thế giới. Nội dung chính của Tạp chí bao gồm các Bài nghiên cứu (khoảng 6000 đến 15000 từ), các bài điểm sách, thông tin khoa học (khoảng 300 đến 1500 từ) được trình bày theo đúng cấu trúc và chuẩn mực của một tạp chí khoa học.\\nCác bài viết của Tạp chí hiện đang được trích dẫn bởi Google Scholar, WorldCat, Open Archives, Cosmos Impact Factor, Advanced Sciences Index, Scientific Indexing Services, CrossRef, EBSCO Information Services.\\nMọi thông tin xin liên hệ: \"},{\"attributes\":{\"italic\":true},\"insert\":\"Phòng Tạp chí, 701 - E, Trường Đại học Khoa học Xã hội và Nhân văn, 336 Nguyễn Trãi, Thanh Xuân, Hà Nội. ĐT: 024.35581984; email: tckhxhnv@vnu.edu.vn \"},{\"insert\":\"hoặc \"},{\"attributes\":{\"italic\":true},\"insert\":\"tapchikhxhnv@gmail.com \"},{\"insert\":\"\\n\"}]}",{"EN":494,"VI":495},"VNU Journal of Social Sciences and Humanities","Tạp chí Khoa học Xã hội và Nhân văn",[101,102],[],[499],{"id":500,"createTime":501,"updateTime":502,"relativeEntities":503,"slug":504,"properties":505,"entityType":98,"verifyStatus":25,"verifyTime":509,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":222,"url":26,"parentIds":510,"statistic":511},"8b6e349b-0daf-4895-9c3f-85f30f1bfd42","2023-07-31T12:55:58.430+00:00","2026-06-19T02:30:07.899+00:00",[],"Tr%C6%B0%E1%BB%9Dng-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Khoa-h%E1%BB%8Dc-X%C3%A3-h%E1%BB%99i-v%C3%A0-Nh%C3%A2n-v%C4%83n-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-H%C3%A0-N%E1%BB%99i",{"title":506},{"EN":507,"VI":508},"VNU University of Social Sciences and Humanities","Trường Đại học Khoa học Xã hội và Nhân văn, Đại học Quốc gia Hà Nội","2023-08-02T15:28:49.057+00:00",[],{"impactFactor":36,"impactFactorByYear":512,"i10Index":59,"i10IndexLast5Year":115,"totalPublication":514,"totalPublicationByYear":515,"totalCitation":518,"totalCitationByYear":519,"totalCitationPerPublication":520,"totalCitationPerPublicationByYear":521,"hindexLast5Year":162,"hindex":162},{"2016":229,"2017":230,"2018":229,"2021":230,"2022":58,"2023":513,"2024":38},0.15,365,{"2013":115,"2014":158,"2015":125,"2016":252,"2017":44,"2018":516,"2019":286,"2020":396,"2021":259,"2022":517,"2023":396,"2024":115,"2025":59,"2026":115},21,42,169,{"2015":283,"2016":135,"2017":52,"2018":50,"2019":298,"2020":53,"2021":359,"2022":115,"2023":115},0.46,{"2015":266,"2016":57,"2017":57,"2018":522,"2019":523,"2020":524,"2021":368,"2022":229,"2023":39},0.38,0.32,0.37,[],"http:\u002F\u002Fjournal.ussh.vnu.edu.vn\u002Findex.php\u002Fvjossh","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F2b8d7b12-2d20-4777-be98-077f44f03c69\u002F0bd0751202944a4b4165b482e6e623e4.png",{"impactFactor":36,"impactFactorByYear":529,"i10Index":162,"i10IndexLast5Year":115,"totalPublication":530,"totalPublicationByYear":531,"totalCitation":537,"totalCitationByYear":538,"totalCitationPerPublication":343,"totalCitationPerPublicationByYear":540,"hindexLast5Year":135,"hindex":135},{"2016":341,"2017":39,"2018":229,"2019":38,"2020":110,"2021":231,"2022":231,"2023":341,"2024":39},764,{"2015":255,"2016":245,"2017":532,"2018":259,"2019":533,"2020":534,"2021":535,"2022":536,"2023":534,"2024":254,"2025":50},111,106,68,92,89,265,{"2015":539,"2016":241,"2017":168,"2018":51,"2019":349,"2020":260,"2021":244,"2022":298,"2023":114},46,{"2015":541,"2016":523,"2017":524,"2018":290,"2019":542,"2020":522,"2021":523,"2022":57,"2023":39},1.48,0.63,{"id":544,"createTime":545,"updateTime":546,"relativeEntities":547,"slug":548,"properties":549,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":558,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"subjectFields":559,"manageAffiliations":560,"indexDatabases":561,"url":562,"thumbnailPath":563,"statistic":564,"gsStatistic":26,"type":26,"analyzePriority":26},"6ec01bd0-15c0-469a-86ac-41339076ae0a","2023-08-10T07:08:33.153+00:00","2026-01-31T21:19:06.362+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Da-li%E1%BB%85u-h%E1%BB%8Dc-Vi%E1%BB%87t-Nam",{"country":550,"issn":551,"introduce":553,"title":555},{"VOID":15},{"VOID":552},"18594824",{"VI":554},"{\"ops\":[{\"insert\":\"Tạp chí “Da liễu học Việt Nam” (Tiếng Anh: Vietnamese Journal of Dermatology and Venereology) thuộc Hội Da liễu Việt Nam, xuất bản 4 số mỗi năm bằng tiếng Việt hoặc tiếng Anh.\\nTạp chí Da liễu học Việt Nam hoạt động với mục đích, tôn chỉ là phổ biến, trao đổi thông tin trong lĩnh vực chuyên ngành da liễu; đăng tải các công trình nghiên cứu khoa học; chuyển giao công nghệ - kinh tế và khoa học kỹ thuật liên quan đến lĩnh vực da liễu.\\nPhạm vi của tạp chí là tất cả các bài báo khoa học, bài tổng quan, giới thiệu ca lâm sàng, … có liên quan tới chuyên ngành da liễu trong và ngoài nước. Tạp chí công bố các công trình nghiên cứu liên quan đến mô hình bệnh tật, các phương pháp chẩn đoán, điều trị, dự phòng và phục hồi chức năng các bệnh thuộc chuyên ngành da liễu. Ngoài ra, tạp chí còn đăng tải các bài tổng quan, cập nhật thông tin, kiến thức, hướng dẫn chẩn đoán, điều trị trong chuyên ngành da liễu trong nước và quốc tế; đăng tải các bài ca lâm sàng đặc biệt trong chuyên ngành da liễu.\\nTạp chí Da liễu học Việt Nam được biết tới là một tạp chí chuyên ngành có uy tín trong lĩnh vực da liễu. Các bài báo về nghiên cứu khoa học đăng trong Tạp chí được bình duyệt một cách nghiêm ngặt bởi ít nhất 2 chuyên gia. Hội đồng biên tập tạp chí bao gồm các nhà khoa học có uy tín (Giáo sư, Phó Giáo sư, Tiến sĩ, Bác sĩ…) trong chuyên ngành da liễu nhằm đảm bảo chất lượng và tính khách quan, khoa học cho các bài viết đăng trên Tạp chí.\\n\"}]}",{"EN":556,"VI":557},"Vietnamese Journal of Dermatology and Venereology","Tạp chí Da liễu học Việt Nam","Admin Import",[],[],[],"https:\u002F\u002Fvjdv.vn\u002Findex.php\u002Fvjdv","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F6ec01bd0-15c0-469a-86ac-41339076ae0a\u002F3cbc81720e58429dc7b1c4d7ab1935ca.jpg",{"impactFactor":36,"impactFactorByYear":565,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":566,"totalPublicationByYear":567,"totalCitation":116,"totalCitationByYear":570,"totalCitationPerPublication":109,"totalCitationPerPublicationByYear":571,"hindexLast5Year":115,"hindex":115},{"2023":38,"2024":230},182,{"2022":568,"2023":45,"2024":569},69,56,{"2022":52,"2023":115},{"2022":40,"2023":229},{"id":573,"createTime":574,"updateTime":575,"relativeEntities":576,"slug":577,"properties":578,"entityType":24,"verifyStatus":25,"verifyTime":26,"verifyNote":27,"syncStatus":28,"languages":587,"translateLanguages":26,"viewCount":283,"subjectFields":588,"manageAffiliations":589,"indexDatabases":647,"url":648,"thumbnailPath":649,"statistic":650,"gsStatistic":26,"type":26,"analyzePriority":26},"19221551-7519-47ff-a892-331d1139c64b","2023-09-12T07:03:05.744+00:00","2026-01-24T20:54:40.144+00:00",[],"T%E1%BA%A1p-ch%C3%AD-Khoa-h%E1%BB%8Dc-S%E1%BB%A9c-kho%E1%BA%BB-%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":579,"issn":580,"introduce":582,"title":584},{"VOID":15},{"VOID":581},"27349446",{"EN":583},"{\"ops\":[{\"attributes\":{\"bold\":true},\"insert\":\"1. History\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"Science and Technology Development Journal\"},{\"insert\":\" (STDJ) (ISSN 2734-9446), Vietnam National University - Ho Chi Minh City (VNU-HCM) was established in 1997. And the first issue was published in January 1998 with ISSN 1859-0128. Since then, STDJ has become the most important scientific forum of scientists from VNU-HCM as well as other universities. The magazine has undergone 20 years of development and has become a bridge for scientific exchanges, as well as enriching reference materials for the faculty, doctoral students, students of VNU-HCM in particular and other universities, institutes...\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Science and Technology Development Journal - Health Sciences (STDJ-HS) is a subjournal of Science and Technology Development Journal since 2020.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\" \"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"attributes\":{\"bold\":true},\"insert\":\"2. Focus and Scope\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Publishing articles with contents on healthcare, research projects in the field of health, advanced directions in health education and management. Therefore, STDJ-HS will accept articles from doctors, administrators, teachers, researchers, graduate students and fellows. The authors will be responsible for the accuracy of the data, opinions, opinions and material cited in the article.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"Facilitating the exchange of scientific and technological information and act as a bridge between theory and practice in the community of educators, scientists, managers, policy makers and enterprises in and out of the country.\"},{\"attributes\":{\"align\":\"justify\"},\"insert\":\"\\n\"},{\"insert\":\"\\n\"}]}",{"EN":585,"VI":586},"VNUHCM JOURNAL OF HEALTH SCIENCES","Tạp chí Khoa học Sức khoẻ Đại học Quốc gia Thành phố Hồ Chí Minh",[101,102],[],[590],{"id":591,"createTime":592,"updateTime":593,"relativeEntities":594,"slug":595,"properties":596,"entityType":98,"verifyStatus":25,"verifyTime":606,"verifyNote":26,"syncStatus":28,"languages":607,"translateLanguages":26,"viewCount":608,"url":609,"parentIds":610,"statistic":611},"fc4c2560-868c-4677-acb1-8686bef88727","2023-06-26T04:48:23.774+00:00","2026-06-19T01:46:17.248+00:00",[],"%C4%90%E1%BA%A1i-h%E1%BB%8Dc-Qu%E1%BB%91c-gia-Th%C3%A0nh-ph%E1%BB%91-H%E1%BB%93-Ch%C3%AD-Minh",{"country":597,"title":598,"abbreviation":601,"address":603},{"VOID":15},{"EN":599,"VI":600},"Vietnam National University Ho Chi Minh City","Đại học Quốc gia Thành phố Hồ Chí Minh",{"VOID":602},"VNUHCM",{"VI":604,"EN":605},"khu phố 6, Phường Linh Trung, Thành phố Thủ Đức, Thành phố Hồ Chí Minh, Việt Nam","Quarter 6, Linh Trung Ward, Thu Duc City, Ho Chi Minh City, Vietnam","2023-08-16T14:13:07.134+00:00",[101,102],45,"https:\u002F\u002Fvnuhcm.edu.vn\u002F",[],{"impactFactor":36,"impactFactorByYear":612,"i10Index":285,"i10IndexLast5Year":51,"totalPublication":613,"totalPublicationByYear":614,"totalCitation":624,"totalCitationByYear":625,"totalCitationPerPublication":634,"totalCitationPerPublicationByYear":635,"hindexLast5Year":124,"hindex":124},{"2014":36,"2015":38,"2016":109,"2017":39,"2018":229,"2019":38,"2020":110,"2021":171,"2022":110,"2023":110,"2024":171,"2025":229},3708,{"2005":115,"2006":115,"2007":115,"2008":135,"2009":111,"2010":53,"2011":52,"2012":568,"2013":615,"2014":351,"2015":616,"2016":469,"2017":617,"2018":127,"2019":618,"2020":619,"2021":620,"2022":621,"2023":622,"2024":623,"2025":159,"2026":50},164,266,177,226,603,931,314,246,74,2399,{"2006":115,"2008":50,"2010":162,"2011":242,"2012":222,"2013":43,"2014":626,"2015":627,"2016":628,"2017":629,"2018":258,"2019":630,"2020":631,"2021":632,"2022":633,"2023":353,"2024":115},250,124,157,162,152,385,559,128,0.65,{"2006":115,"2008":636,"2010":637,"2011":638,"2012":639,"2013":522,"2014":640,"2015":641,"2016":642,"2017":643,"2018":644,"2019":642,"2020":645,"2021":292,"2022":646,"2023":522,"2024":38},1.33,0.45,2.22,0.39,1.35,0.47,0.67,0.92,0.73,0.64,0.41,[],"http:\u002F\u002Fstdjhs.scienceandtechnology.com.vn\u002Findex.php\u002Fstdjhs","\u002Fapi\u002Fpublic\u002Ffile\u002Fpublisher\u002F19221551-7519-47ff-a892-331d1139c64b\u002F2e10768b7d1e380c36a25ed0c714dd7e.png",{"impactFactor":36,"impactFactorByYear":651,"i10Index":36,"i10IndexLast5Year":36,"totalPublication":652,"totalPublicationByYear":653,"totalCitation":516,"totalCitationByYear":654,"totalCitationPerPublication":151,"totalCitationPerPublicationByYear":655,"hindexLast5Year":59,"hindex":59},{"2022":57,"2023":108,"2024":39},79,{"2020":116,"2021":240,"2022":239,"2023":52,"2024":162,"2025":162},{"2020":59,"2021":51,"2022":59},{"2020":443,"2021":387,"2022":54},{"code":657,"data":658,"meta":26},"SUCCESS",{"id":659,"createTime":660,"updateTime":661,"relativeEntities":662,"slug":663,"properties":664,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":673,"manageAffiliations":698,"indexDatabases":719,"url":26,"thumbnailPath":26,"statistic":760,"gsStatistic":26,"type":175,"analyzePriority":26},"b9c99dfe-b878-4a5b-81cf-0482f03f73fd","2024-04-09T00:42:44.433+00:00","2025-11-21T10:00:38.381+00:00",[],"Journal-of-Automated-Reasoning",{"issn":665,"eissn":667,"title":669,"url":671},{"VOID":666},"15730670",{"VOID":668},"01687433",{"EN":670},"Journal of Automated Reasoning",{"VOID":672},"https:\u002F\u002Flink.springer.com\u002Fjournal\u002F10817",[674,682,690],{"id":675,"createTime":676,"updateTime":677,"relativeEntities":678,"label":679,"description":681,"parentId":26,"standard":26,"scholarHubFieldId":26},"e8c4e2fa-b139-4154-a158-595bd93d381c","2023-05-29T10:24:07.692+00:00","2023-11-21T07:15:31.396+00:00",[],{"EN":680},"Computational Theory and Mathematics",{},{"id":683,"createTime":684,"updateTime":685,"relativeEntities":686,"label":687,"description":689,"parentId":26,"standard":26,"scholarHubFieldId":26},"aae089e7-8b62-4df4-ab86-aada3693b3f8","2023-05-29T10:24:07.736+00:00","2023-11-21T07:29:12.850+00:00",[],{"EN":688},"Software",{},{"id":691,"createTime":692,"updateTime":693,"relativeEntities":694,"label":695,"description":697,"parentId":26,"standard":26,"scholarHubFieldId":26},"6a3cb349-a9fc-40fb-9aa8-c9946de1e629","2023-05-29T10:24:01.672+00:00","2023-11-21T06:16:02.793+00:00",[],{"EN":696},"Artificial Intelligence",{},[699,708],{"id":700,"createTime":701,"updateTime":702,"relativeEntities":703,"slug":704,"properties":705,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"url":26,"parentIds":707,"statistic":26},"26a19206-5cad-4456-bb2f-49abd254fbc6","2024-04-19T01:59:34.612+00:00","2025-11-21T10:06:47.646+00:00",[],"SPRINGER",{"title":706},{"EN":704},[],{"id":709,"createTime":710,"updateTime":711,"relativeEntities":712,"slug":713,"properties":714,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":50,"url":26,"parentIds":717,"statistic":26},"b2bfac93-563a-4fa4-bd81-e546a66bf9bd","2023-05-29T10:24:01.641+00:00","2025-11-21T10:06:17.751+00:00",[],"Springer-Netherlands",{"title":715},{"EN":716},"Springer Netherlands",[718],"9a7c7208-b28a-42c2-a634-5a7f90eee3ab",[720,741],{"id":721,"indexDatabase":722,"url":734,"indexYears":735,"academicFieldIds":736,"indexDatabaseRanking":740},"23dde35e-108f-4951-a68d-e2a20fe7f1e7",{"id":723,"createTime":724,"updateTime":725,"relativeEntities":726,"label":727,"description":729,"key":731,"publicationTags":732,"standard":26},"3c7051d4-eb7d-4c57-a56b-36fc74c5d1e9","2023-05-22T09:57:18.509+00:00","2025-11-21T10:07:52.274+00:00",[],{"EN":728,"VI":728},"Scopus - Elsevier",{"EN":728,"VI":730},"Cơ sở dữ liệu Scopus thuộc Elsevier","scopus",[733],"SCOPUS","https:\u002F\u002Fwww.scopus.com\u002Fsourceid\u002F24354","1985-2025",[737,738,739],"bccef185-f7d5-4f2e-881a-2dc383ea6c57","ea95f5ee-62c8-4ccb-8e3e-d3a8bc9e97cb","f8ab36fc-bc72-48f2-a425-9f3e042f2272","SCOPUS__Q1",{"id":742,"indexDatabase":743,"url":757,"indexYears":26,"academicFieldIds":758,"indexDatabaseRanking":26},"f82348c7-c804-4e89-9bd8-b1a68e70955d",{"id":744,"createTime":745,"updateTime":746,"relativeEntities":747,"label":748,"description":750,"key":753,"publicationTags":754,"standard":26},"a4921856-b128-4d9f-8f1f-e80813d3bbd4","2023-05-22T09:59:31.026+00:00","2025-11-21T10:07:52.153+00:00",[],{"EN":749,"VI":749},"ISI\u002FSCIE - Science Citation Index Expanded",{"VI":751,"EN":752},"Cơ sở dữ liệu SCIE","SCIE database","scie",[755,756],"SCIE","ISI","https:\u002F\u002Fmjl.clarivate.com\u002Fsearch-results?issn=0168-7433",[759],"1acb72da-cafe-4349-b117-01c5aabcd399",{"impactFactor":36,"impactFactorByYear":761,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":767,"totalCitation":768,"totalCitationByYear":769,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":781,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},0.85,0.93,0.48,0.34,936,{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},3509,{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},297,186,55,155,284,75,62,497,241,198,3.75,{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},15.44,19.8,7.11,9.79,2.39,1.64,3.76,4.7,12.91,7.76,3.65,5.77,5.64,2.48,17.75,1.78,3.17,12.05,14.14,2.57,1.86,4.6,1.93,0.29,{"meta":807,"data":809},{"total":808},"936",[810,903,1049,1279,1634,1976,2224,2431,2601,2939],{"id":811,"createTime":812,"updateTime":813,"relativeEntities":814,"slug":815,"properties":816,"entityType":827,"verifyStatus":25,"verifyTime":813,"verifyNote":828,"syncStatus":28,"languages":829,"translateLanguages":26,"viewCount":36,"primaryUrl":830,"fullTextUrl":26,"authors":831,"publicationType":860,"publisherRelationship":861,"citationCount":896,"citationInfo":897,"publishDate":899,"publishYear":900,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":901,"isForceReanalyzing":902},"b716db40-90b5-4bb7-93d4-c58e6379e675","2024-04-17T02:11:40.155+00:00","2025-01-02T02:42:18.946+00:00",[],"Automated-deduction-by-theory-resolution",{"mag":817,"keywords":819,"openalex":820,"abstract":822,"title":823,"doi":825},{"VOID":818},"2047669821",{},{"VOID":821},"W2047669821",{},{"EN":824},"Automated deduction by theory resolution",{"VOID":826},"10.1007\u002Fbf00244275","PUBLICATION","Auto Verify",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF00244275",[832],{"id":833,"sortIndex":36,"researcher":26,"roles":834,"affiliations":835,"properties":855},"0748a01e-7b35-4e34-8df0-a4ce12a76f5e",[],[836,845],{"id":837,"sortIndex":115,"affiliation":838,"properties":26},"7d8bea62-a26b-492e-94a3-52ce7a757b15",{"id":839,"createTime":840,"updateTime":840,"relativeEntities":841,"slug":26,"properties":842,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"7c60dd16-7aad-4666-8649-8a08d9a18717","2023-12-17T20:30:02.478+00:00",[],{"title":843},{"VI":844},"Center for the Study of Language and Information Stanford University, Stanford, USA",{"id":846,"sortIndex":36,"affiliation":847,"properties":26},"4086b616-c8ba-46d7-93f5-e3cfcd40d4ef",{"id":848,"createTime":849,"updateTime":849,"relativeEntities":850,"slug":851,"properties":852,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"17c12ab0-2cfb-466b-8911-415e85fc24a4","2024-04-17T02:11:40.166+00:00",[],"Artificial-Intelligence-Center-SRI-International-Meulo-Park-USA",{"title":853},{"EN":854},"Artificial Intelligence Center, SRI International, Meulo Park, USA",{"openalex":856,"title":858},{"VOID":857},"A5076636496",{"EN":859},"Mark E. Stickel","ARTICLE",{"url":26,"publisher":862,"properties":891},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":863,"slug":663,"properties":864,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":869,"manageAffiliations":870,"indexDatabases":871,"url":26,"thumbnailPath":26,"statistic":886,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":865,"eissn":866,"title":867,"url":868},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[872,879],{"id":721,"indexDatabase":873,"url":734,"indexYears":735,"academicFieldIds":878,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":874,"label":875,"description":876,"key":731,"publicationTags":877,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":880,"url":757,"indexYears":26,"academicFieldIds":885,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":881,"label":882,"description":883,"key":753,"publicationTags":884,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":887,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":888,"totalCitation":768,"totalCitationByYear":889,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":890,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},{"volume":892,"issue":894},{"VOID":893},"1",{"VOID":895},"4",242,{"total":896,"publishYear":26,"statisticByYear":898},{"2012":115,"2013":114,"2014":114,"2015":114,"2018":114,"2019":115,"2022":115,"2024":115},"1985-01-01",1985,[],false,{"id":904,"createTime":905,"updateTime":906,"relativeEntities":907,"slug":908,"properties":909,"entityType":827,"verifyStatus":25,"verifyTime":906,"verifyNote":828,"syncStatus":28,"languages":920,"translateLanguages":26,"viewCount":36,"primaryUrl":921,"fullTextUrl":26,"authors":922,"publicationType":860,"publisherRelationship":940,"citationCount":970,"citationInfo":971,"publishDate":973,"publishYear":974,"citationAnalyzeStatus":975,"lastCitationAnalyze":976,"indexDatabases":26,"openAccess":26,"references":977,"isForceReanalyzing":902},"0bf4139b-48f9-4adb-8eef-021f1e0dc97e","2024-04-11T17:31:31.494+00:00","2024-12-24T23:33:44.318+00:00",[],"Seventy-five-problems-for-testing-automatic-theorem-provers",{"mag":910,"keywords":912,"openalex":913,"abstract":915,"title":916,"doi":918},{"VOID":911},"2126583599",{},{"VOID":914},"W2126583599",{},{"EN":917},"Seventy-five problems for testing automatic theorem provers",{"VOID":919},"10.1007\u002Fbf02432151",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF02432151",[923],{"id":924,"sortIndex":36,"researcher":26,"roles":925,"affiliations":926,"properties":935},"0d2d723f-f313-435c-a52a-181c60a9a0e0",[],[927],{"id":26,"sortIndex":36,"affiliation":928,"properties":26},{"id":929,"createTime":930,"updateTime":930,"relativeEntities":931,"slug":26,"properties":932,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"283d7b79-0f42-43c4-a04c-eac61fc45ba6","2023-12-11T08:05:37.360+00:00",[],{"title":933},{"VI":934},"Department of Philosophy, University of Alberta, Edmonton, Canada",{"openalex":936,"title":938},{"VOID":937},"A5006576404",{"EN":939},"Francis Jeffry Pelletier",{"url":26,"publisher":941,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":942,"slug":663,"properties":943,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":948,"manageAffiliations":949,"indexDatabases":950,"url":26,"thumbnailPath":26,"statistic":965,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":944,"eissn":945,"title":946,"url":947},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[951,958],{"id":721,"indexDatabase":952,"url":734,"indexYears":735,"academicFieldIds":957,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":953,"label":954,"description":955,"key":731,"publicationTags":956,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":959,"url":757,"indexYears":26,"academicFieldIds":964,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":960,"label":961,"description":962,"key":753,"publicationTags":963,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":966,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":967,"totalCitation":768,"totalCitationByYear":968,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":969,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},184,{"total":970,"publishYear":26,"statisticByYear":972},{"2014":115,"2015":111,"2017":115,"2018":59,"2019":114,"2021":59,"2022":114,"2023":114},"1986-06-01",1986,"ERROR_IN_ANALYZE_CITATION","2024-04-11T20:30:51.594+00:00",[978,982,986,989,993,996,999,1003,1006,1010,1013,1016,1019,1022,1026,1030,1033,1036,1039,1042,1046],{"id":26,"text":979,"url":26,"identifiers":980},"BledsoeW., BoyerR., and HennemanW. (1972) ‘Computer proofs of limit theorems’,Artificial Intelligence,3, 27–60.",{"doi":981},"10.1016\u002F0004-3702(72)90041-0",{"id":26,"text":983,"url":26,"identifiers":984},"CookS. and ReckhowR. (1979) ‘The relative efficiency of propositional proof systems’,J. Symbolic Logic 44, 36–50.",{"doi":985},"10.2307\u002F2273702",{"id":26,"text":987,"url":26,"identifiers":988},"DeChampeauxD. (1979) ‘Sub-problem finder and instance checker: two cooperating preprocessors for theorem provers’IJCAI 6, 191–196.",{},{"id":26,"text":990,"url":26,"identifiers":991},"GalilZ. (1977) ‘On resolution with clauses of bounded size’,SIAM J. Computing 6, 444–459.",{"doi":992},"10.1137\u002F0206031",{"id":26,"text":994,"url":26,"identifiers":995},"Kalish, D. & Montague, R. (1964)Logic: Techniques of Formal Reasoning, World, Harcourt & Brace,",{},{"id":26,"text":997,"url":26,"identifiers":998},"LuskE. and OverbeekR. (1985) ‘Reasoning about equality’,J. Automated Reasoning,1, 209–228.",{},{"id":26,"text":1000,"url":26,"identifiers":1001},"McCharenR., OverbeekR., & WosL. (1976) ‘Problems and experiments for and with automated theorem-proving programs’,IEEE Trans. Computers C-25(8), 773–782.",{"doi":1002},"10.1109\u002FTC.1976.1674696",{"id":26,"text":1004,"url":26,"identifiers":1005},"McCuneW. (1985) ‘Schubert's Steamroller Problem with linked UR-resolution’Assoc. Automated Reasoning Newsletter,4, 4–6.",{},{"id":26,"text":1007,"url":26,"identifiers":1008},"MontagueR. (1955) ‘On the paradox of grounded classes’J. Symbolic Logic 20, 140.",{"doi":1009},"10.2307\u002F2266899",{"id":26,"text":1011,"url":26,"identifiers":1012},"NewellA., ShawJ., and SimonH. (1957) ‘Empirical explorations with the logic theory machine: a case study in heuristics’. Reprinted in E.Feigenbaum and J.Feldman (eds.)Computers and Thought (McGraw-Hill, N.Y.) pp. 279–293 (1963).",{},{"id":26,"text":1014,"url":26,"identifiers":1015},"NewellA. and SimonH. (1972)Human Problem Solving, (Prentice-Hall, Englewood Cliffs).",{},{"id":26,"text":1017,"url":26,"identifiers":1018},"PelletierF. J. (1982) ‘Completely nonclausal, completely heuristically driven automatic theorem proving’, Technical Report TR82-7, (Dept. of Computing Science, Edmonton, Alberta).",{},{"id":26,"text":1020,"url":26,"identifiers":1021},"PelletierF. J. (1985) ‘Six problems in translational equivalence’,Logique et Analyse 108, 423–434.",{},{"id":26,"text":1023,"url":26,"identifiers":1024},"SiklóssyL., RichA., and MarinovV. (1973) ‘Breadth first search: some surprising results’,Artificial Intelligence 4, 1–27.",{"doi":1025},"10.1016\u002F0004-3702(73)90006-4",{"id":26,"text":1027,"url":26,"identifiers":1028},"StickelM. (1986) ‘Schubert's steamroller problem: formulations and solutions’,J. Automated Reasoning 2, 89–104.",{"doi":1029},"10.1007\u002FBF00246025",{"id":26,"text":1031,"url":26,"identifiers":1032},"ThomasonR. (1972)Symbolic Logic (Prentice-Hall, Englewood Cliffs).",{},{"id":26,"text":1034,"url":26,"identifiers":1035},"TseitinG. S. (1968) ‘On the complexity of derivation in propositional calculus’, reprinted in J.Siekmann and G.Wrightson (eds.)Automation of Reasoning (Springer-Verlag, Berlin).",{},{"id":26,"text":1037,"url":26,"identifiers":1038},"Urquhart, A. (unpublished a) ‘The complexity of Genzen systems for propositional logic’.",{},{"id":26,"text":1040,"url":26,"identifiers":1041},"Urquhart, A. (unpublished b) ‘Hard examples for resolution’.",{},{"id":26,"text":1043,"url":26,"identifiers":1044},"WaltherC. (1985) ‘A mechanical solution of Schubert's steamroller by many-sorted resolution’,Artificial Intelligence 26, 217–224.",{"doi":1045},"10.1016\u002F0004-3702(85)90029-3",{"id":26,"text":1047,"url":26,"identifiers":1048},"WhiteheadA. and RussellB. (1910)Principia Mathematica, Vol. I. (Cambridge UP, Cambridge).",{},{"id":1050,"createTime":1051,"updateTime":1052,"relativeEntities":1053,"slug":1054,"properties":1055,"entityType":827,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":1066,"translateLanguages":26,"viewCount":36,"primaryUrl":1067,"fullTextUrl":26,"authors":1068,"publicationType":860,"publisherRelationship":1110,"citationCount":1140,"citationInfo":1141,"publishDate":1143,"publishYear":1144,"citationAnalyzeStatus":975,"lastCitationAnalyze":1052,"indexDatabases":26,"openAccess":26,"references":1145,"isForceReanalyzing":902},"db860e07-4da6-48b1-ba05-b4811c9de713","2024-04-12T03:08:49.010+00:00","2024-04-13T11:56:07.410+00:00",[],"A-Tableau-Decision-Procedure-for-mathcal-SHOIQ-",{"mag":1056,"keywords":1058,"openalex":1059,"abstract":1061,"title":1062,"doi":1064},{"VOID":1057},"1978912716",{},{"VOID":1060},"W1978912716",{},{"EN":1063},"A Tableau Decision Procedure for $\\mathcal{SHOIQ}$",{"VOID":1065},"10.1007\u002Fs10817-007-9079-9",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10817-007-9079-9",[1069,1090],{"id":1070,"sortIndex":115,"researcher":26,"roles":1071,"affiliations":1072,"properties":1083},"28623346-98e8-4840-9edb-a031c70b8c4c",[],[1073],{"id":26,"sortIndex":36,"affiliation":1074,"properties":26},{"id":1075,"createTime":1076,"updateTime":1077,"relativeEntities":1078,"slug":1079,"properties":1080,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"72170207-a7eb-4a64-995c-7e280181266b","2023-12-31T08:10:04.706+00:00","2024-10-12T00:42:21.271+00:00",[],"School-of-Computer-Science-University-of-Manchester-Manchester-UK",{"title":1081},{"VI":1082},"School of Computer Science, University of Manchester, Manchester, UK",{"openalex":1084,"orcid":1086,"title":1088},{"VOID":1085},"A5072391425",{"VOID":1087},"https:\u002F\u002Forcid.org\u002F0000-0003-4103-3389",{"EN":1089},"Ulrike Sattler",{"id":1091,"sortIndex":36,"researcher":26,"roles":1092,"affiliations":1093,"properties":1103},"2d4ee1d4-e416-4433-a8f7-e918b8ae788f",[],[1094],{"id":26,"sortIndex":36,"affiliation":1095,"properties":26},{"id":1096,"createTime":1097,"updateTime":1097,"relativeEntities":1098,"slug":1099,"properties":1100,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"d04a3a53-7d98-41c3-845e-f2fbf5af5ca3","2024-04-12T03:08:49.018+00:00",[],"School-of-Computer-Science-University-of-Manchester-Manchester-UK-M13-9PL-",{"title":1101},{"EN":1102},"School of Computer Science, University of Manchester, Manchester, UK M13 9PL.",{"openalex":1104,"orcid":1106,"title":1108},{"VOID":1105},"A5060350556",{"VOID":1107},"https:\u002F\u002Forcid.org\u002F0000-0002-2685-7462",{"EN":1109},"Ian Horrocks",{"url":26,"publisher":1111,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1112,"slug":663,"properties":1113,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1118,"manageAffiliations":1119,"indexDatabases":1120,"url":26,"thumbnailPath":26,"statistic":1135,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1114,"eissn":1115,"title":1116,"url":1117},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[1121,1128],{"id":721,"indexDatabase":1122,"url":734,"indexYears":735,"academicFieldIds":1127,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":1123,"label":1124,"description":1125,"key":731,"publicationTags":1126,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":1129,"url":757,"indexYears":26,"academicFieldIds":1134,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":1130,"label":1131,"description":1132,"key":753,"publicationTags":1133,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":1136,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":1137,"totalCitation":768,"totalCitationByYear":1138,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":1139,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},158,{"total":1140,"publishYear":26,"statisticByYear":1142},{"2012":356,"2013":356,"2014":173,"2015":52,"2016":158,"2017":115,"2018":111,"2019":158,"2020":114,"2021":115,"2023":111},"2007-08-28",2007,[1146,1149,1152,1155,1159,1162,1166,1170,1173,1177,1180,1183,1186,1189,1192,1196,1199,1202,1205,1208,1211,1214,1217,1221,1225,1228,1232,1235,1239,1243,1246,1249,1253,1256,1259,1263,1267,1270,1273,1276],{"id":26,"text":1147,"url":26,"identifiers":1148},"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F., (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge, MA (2003)",{},{"id":26,"text":1150,"url":26,"identifiers":1151},"Baader, F., Hanschke, P.: A schema for integrating concrete domains into concept languages. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91), pp. 452–457 (1991)",{},{"id":26,"text":1153,"url":26,"identifiers":1154},"Baader, F., Hollunder, B.: A terminological knowledge representation system with complete inference algorithms. In: Proceedings of the First International Workshop on Processing Declarative Knowledge. Lecture Notes in Computer Science, vol. 572, pp. 67–85. Springer, Berlin Heidelberg New York (1991)",{},{"id":26,"text":1156,"url":26,"identifiers":1157},"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Stud. Log. 69(1), 5–40 (2001)",{"doi":1158},"10.1023\u002FA:1013882326814",{"id":26,"text":1160,"url":26,"identifiers":1161},"Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F., Stein, L.A.: OWL Web ontology language reference. W3C Recommendation. Available at http:\u002F\u002Fwww.w3.org\u002FTR\u002Fowl-ref\u002F (2004)",{},{"id":26,"text":1163,"url":26,"identifiers":1164},"Blackburn, P., Seligman, J.: Hybrid languages. J. Logic Lang. Inf. 4, 251–272 (1995)",{"doi":1165},"10.1007\u002FBF01049415",{"id":26,"text":1167,"url":26,"identifiers":1168},"Brachman, R.J., McGuinness, D.L., Patel-Schneider, P.F., Resnick, L.A., Borgida, A.: Living with CLASSIC: when and how to use a KL-ONE-like language. In: Sowa, J.F. (ed.) Principles of Semantic Networks, pp. 401–456. Morgan Kaufmann, Los Altos, CA (1991)",{"doi":1169},"10.1016\u002FB978-1-4832-0771-1.50022-9",{"id":26,"text":1171,"url":26,"identifiers":1172},"Bresciani, P., Franconi, E., Tessaris, S.: Implementing and testing expressive description logics: preliminary report. In: Proceedings of the 1995 Description Logic Workshop (DL’95), pp. 131–139 (1995)",{},{"id":26,"text":1174,"url":26,"identifiers":1175},"Buchheit, M., Donini, F.M., Schaerf, A.: Decidable reasoning in terminological knowledge representation systems. J. Artif. Intell. Res. 1, 109–138 (1993)",{"doi":1176},"10.1613\u002Fjair.21",{"id":26,"text":1178,"url":26,"identifiers":1179},"Calvanese, D., De Giacomo, G., Lenzerini, M., Nardi, D., Rosati, R.: Description logic framework for information integration. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pp. 2–13. Morgan Kaufmann, Los Altos, CA (1998)",{},{"id":26,"text":1181,"url":26,"identifiers":1182},"De Giacomo, G.: Decidability of class-based knowledge representation formalisms. Ph.D. Thesis, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza” (1995)",{},{"id":26,"text":1184,"url":26,"identifiers":1185},"De Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics (extended abstract). In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94). AAAI Press, Menlo Park, CA (1994)",{},{"id":26,"text":1187,"url":26,"identifiers":1188},"De Giacomo, G., Lenzerini, M.: TBox and ABox reasoning in expressive description logics. In: Proceedings of the 5th International Conference on the Principles of Knowledge Representation and Reasoning (KR’96), pp. 316–327. Morgan Kaufmann, Los Altos, CA (1996)",{},{"id":26,"text":1190,"url":26,"identifiers":1191},"Donini, F.M., Lenzerini, M., Nardi, D.: Using terminological reasoning in hybrid systems. AI Commun. – Eur. J. Artif. Intell. 3(3), 128–138 (1990)",{},{"id":26,"text":1193,"url":26,"identifiers":1194},"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194–211 (1979)",{"doi":1195},"10.1016\u002F0022-0000(79)90046-1",{"id":26,"text":1197,"url":26,"identifiers":1198},"Gardiner, T., Tsarkov, D., Horrocks, I.: Framework for an automated comparison of description logic reasoners. In: Proceedings of the 2006 International Semantic Web Conference (ISWC 2006). Lecture Notes in Computer Science, vol. 4273, pp. 654–667. Springer, Berlin Heidelberg New York (2006)",{},{"id":26,"text":1200,"url":26,"identifiers":1201},"Grädel, E.: Why are modal logics so robustly decidable? In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science: Entering the 21st Century, pp. 393–408. World Scientific, Singapore (2001)",{},{"id":26,"text":1203,"url":26,"identifiers":1204},"Haarslev, V., Möller, R.,: The description logic $\\mathcal{ALCNH}_{R+}$ extended with concrete domains: a practically motivated approach. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR 2001). Lecture Notes in Artificial Intelligence, vol. 2083, pp. 29–44. Springer, Berlin Heidelberg New York (2001a)",{},{"id":26,"text":1206,"url":26,"identifiers":1207},"Haarslev, V., Möller, R.: RACER System description. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR 2001). Lecture Notes in Artificial Intelligence, vol. 2083, pp. 701–705. Springer, Berlin Heidelberg New York (2001b)",{},{"id":26,"text":1209,"url":26,"identifiers":1210},"Hladik, J., Model, J.: Tableau systems for $\\mathcal{SHIO}$ and $\\mathcal{SHIQ}$ . In: Proceedings of the 2004 Description Logic Workshop (DL 2004). CEUR. Available from ceur-ws.org (2004)",{},{"id":26,"text":1212,"url":26,"identifiers":1213},"Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. Technical Report RR-91-03, Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI), Kaiserslautern (Germany). An abridged version appeared in Proceedings of the 2nd International Conference on the Principles of Knowledge Representation and Reasoning (KR’91) (1991)",{},{"id":26,"text":1215,"url":26,"identifiers":1216},"Horrocks, I., Patel-Schneider, P.F.: FaCT and DLP: Automated reasoning with analytic tableaux and related methods. In: Proceedings of the 2nd International Conference on Analytic Tableaux and Related Methods (TABLEAUX’98). Lecture Notes in Artificial Intelligence, vol. 1397, pp. 27–30. Springer, Berlin Heidelberg New York (1998)",{},{"id":26,"text":1218,"url":26,"identifiers":1219},"Horrocks, I., Patel-Schneider, P.F.: Optimizing description logic subsumption. J. Log. Comput. 9(3), 267–293 (1999)",{"doi":1220},"10.1093\u002Flogcom\u002F9.3.267",{"id":26,"text":1222,"url":26,"identifiers":1223},"Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From $\\mathcal{SHIQ}$ and RDF to OWL: the making of a web ontology language. J. Web Semantics 1(1), 7–26 (2003)",{"doi":1224},"10.1016\u002Fj.websem.2003.07.001",{"id":26,"text":1226,"url":26,"identifiers":1227},"Horrocks, I., Sattler, U.: Ontology reasoning in the $\\mathcal{SHOQ}$ (D) description logic. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 199–204. Morgan Kaufmann, Los Altos, CA (2001)",{},{"id":26,"text":1229,"url":26,"identifiers":1230},"Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR’99). Lecture Notes in Artificial Intelligence, vol. 1705, pp. 161–180. Springer, Berlin Heidelberg New York (1999)",{"doi":1231},"10.1007\u002F3-540-48242-3_11",{"id":26,"text":1233,"url":26,"identifiers":1234},"Horrocks, I., Sattler, U., Tobies, S.: Reasoning with individuals for the description logic $\\mathcal{SHIQ}$ . In: McAllester, D. (ed.) Proceedings of the 17th International Conference on Automated Deduction (CADE 2000). Lecture Notes in Computer Science, vol. 1831, pp. 482–496. Springer, Berlin Heidelberg New York (2000)",{},{"id":26,"text":1236,"url":26,"identifiers":1237},"McGuinness, D.L., Wright, J.R.: An industrial strength description logic-based configuration platform. IEEE Intell. Syst. 69–77 (1998)",{"doi":1238},"10.1109\u002F5254.708435",{"id":26,"text":1240,"url":26,"identifiers":1241},"Pacholski, L., Szwast, W., Tendera, L.: Complexity of two-variable logic with counting. In: Proceedings of the 12th IEEE Symposium on Logic in Computer Science (LICS’97), pp. 318–327. IEEE Computer Society Press, Los Alamitos, CA (1997)",{"doi":1242},"10.1109\u002FLICS.1997.614958",{"id":26,"text":1244,"url":26,"identifiers":1245},"Pan, J., Horrocks, I.: Web ontology reasoning with datatype groups. In: Fensel, D., Sycara, K., Mylopoulos, J. (eds.) Proc. of the 2003 International Semantic Web Conference (ISWC 2003). Lecture Notes in Computer Science, vol. 2870, pp. 47–63. Springer, Berlin Heidelberg New York (2003)",{},{"id":26,"text":1247,"url":26,"identifiers":1248},"Patel-Schneider, P.F., Owsnicki-Klew, B., Kobsa, A., Guarino, N., MacGregor, R., Mark, W.S., McGuinness, D., Nebel, B., Schmiedel, A., Yen, J.: Term subsumption languages in knowledge representation. AI Mag. 11(2), 16–23 (1990)",{},{"id":26,"text":1250,"url":26,"identifiers":1251},"Schaerf, A.: Reasoning with individuals in concept languages. Data Knowl. Eng. 13(2), 141–176 (1994)",{"doi":1252},"10.1016\u002F0169-023X(94)90002-7",{"id":26,"text":1254,"url":26,"identifiers":1255},"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI’91), pp. 466–471. Morgan Kaufmann, Los Altos, CA (1991)",{},{"id":26,"text":1257,"url":26,"identifiers":1258},"Sirin, E., Grau, B.C., Parsia, B.: From wine to water: optimizing description logic reasoning for nominals. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 90–99. AAAI Press (2006)",{},{"id":26,"text":1260,"url":26,"identifiers":1261},"Sirin, E., Parsia, B., Cuenca, B. Grau, Kalyanpur, A., Katz, Y.: Pellet: a practical OWL-DL reasoner. J. Web Semantics 5(2), 51–53 (2007)",{"doi":1262},"10.1016\u002Fj.websem.2007.03.004",{"id":26,"text":1264,"url":26,"identifiers":1265},"Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. Artif. Intell. Res. 12, 199–217 (2000)",{"doi":1266},"10.1613\u002Fjair.705",{"id":26,"text":1268,"url":26,"identifiers":1269},"Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. Ph.D. thesis, LuFG Theoretical Computer Science, RWTH-Aachen, Germany (2001)",{},{"id":26,"text":1271,"url":26,"identifiers":1272},"Tsarkov, D., Horrocks, I.: Ordering heuristics for description logic reasoning. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 609–614. Morgan Kaufmann, Los Altos (2005)",{},{"id":26,"text":1274,"url":26,"identifiers":1275},"Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: system description. In: Proceedings of the International Joint Conference on Automated Reasoning (IJCAR 2006). Lecture Notes in Artificial Intelligence, vol. 4130, pp. 292–297. Springer, Berlin Heidelberg New York (2006)",{},{"id":26,"text":1277,"url":26,"identifiers":1278},"Vardi, M.Y.: Why is modal logic so robustly decidable. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, pp. 149–184. American Mathematical Society, Providence, RI (1997)",{},{"id":1280,"createTime":1281,"updateTime":1282,"relativeEntities":1283,"slug":1284,"properties":1285,"entityType":827,"verifyStatus":25,"verifyTime":1282,"verifyNote":828,"syncStatus":28,"languages":1296,"translateLanguages":26,"viewCount":36,"primaryUrl":1297,"fullTextUrl":26,"authors":1298,"publicationType":860,"publisherRelationship":1367,"citationCount":1397,"citationInfo":1398,"publishDate":1400,"publishYear":1144,"citationAnalyzeStatus":975,"lastCitationAnalyze":1401,"indexDatabases":26,"openAccess":26,"references":1402,"isForceReanalyzing":902},"5d0d6cc1-c627-48cc-9d92-81b0662269b4","2024-04-13T14:57:09.495+00:00","2025-01-18T07:35:22.971+00:00",[],"Answer-Set-Programming-Based-on-Propositional-Satisfiability",{"mag":1286,"keywords":1288,"openalex":1289,"abstract":1291,"title":1292,"doi":1294},{"VOID":1287},"2100699693",{},{"VOID":1290},"W2100699693",{},{"EN":1293},"Answer Set Programming Based on Propositional Satisfiability",{"VOID":1295},"10.1007\u002Fs10817-006-9033-2",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10817-006-9033-2",[1299,1327,1347],{"id":1300,"sortIndex":114,"researcher":26,"roles":1301,"affiliations":1302,"properties":1320},"f7960898-924c-4cce-ab87-4c021614898a",[],[1303,1311],{"id":26,"sortIndex":36,"affiliation":1304,"properties":26},{"id":1305,"createTime":1306,"updateTime":1306,"relativeEntities":1307,"slug":26,"properties":1308,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"5f0cfacd-ea46-449b-85d8-67ef82cf7a75","2024-01-11T09:08:37.402+00:00",[],{"title":1309},{"VI":1310},"Department of Mathematics, University of Calabria, Rende, Italy",{"id":26,"sortIndex":36,"affiliation":1312,"properties":26},{"id":1313,"createTime":1314,"updateTime":1314,"relativeEntities":1315,"slug":1316,"properties":1317,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e42ea029-4848-4b1d-8fea-c21f14764074","2024-04-13T14:57:09.534+00:00",[],"STAR-Lab-DIST-University-of-Genova-Genova-Italy",{"title":1318},{"EN":1319},"STAR-Lab, DIST, University of Genova, Genova, Italy",{"openalex":1321,"orcid":1323,"title":1325},{"VOID":1322},"A5077756388",{"VOID":1324},"https:\u002F\u002Forcid.org\u002F0000-0002-9034-2527",{"EN":1326},"Marco Maratea",{"id":1328,"sortIndex":115,"researcher":26,"roles":1329,"affiliations":1330,"properties":1340},"2047c29e-6195-4e7f-8eb5-9c7a87e946cc",[],[1331],{"id":26,"sortIndex":36,"affiliation":1332,"properties":26},{"id":1333,"createTime":1334,"updateTime":1334,"relativeEntities":1335,"slug":1336,"properties":1337,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"df9d3816-7bca-4cbb-abe4-c74c5186cee5","2024-04-13T14:57:09.517+00:00",[],"Institut-f%C3%BCr-Informatik-Erlangen-N%C3%BCrnberg-Universit%C3%A4t-Erlangen-Germany",{"title":1338},{"EN":1339},"Institut für Informatik, Erlangen-Nürnberg-Universität, Erlangen, Germany",{"openalex":1341,"orcid":1343,"title":1345},{"VOID":1342},"A5008816972",{"VOID":1344},"https:\u002F\u002Forcid.org\u002F0000-0002-6146-623X",{"EN":1346},"Yuliya Lierler",{"id":1348,"sortIndex":36,"researcher":26,"roles":1349,"affiliations":1350,"properties":1360},"bd8046b9-215d-4f94-b112-97f7220a305f",[],[1351],{"id":26,"sortIndex":36,"affiliation":1352,"properties":26},{"id":1353,"createTime":1354,"updateTime":1354,"relativeEntities":1355,"slug":1356,"properties":1357,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"c5153b90-f49a-4163-8053-b82abb699db4","2024-04-13T14:57:09.506+00:00",[],"STAR-Lab-DIST-University-of-Genova-Genova-Italy-13-16145",{"title":1358},{"EN":1359},"STAR-Lab, DIST, University of Genova, Genova, Italy 13-16145",{"openalex":1361,"orcid":1363,"title":1365},{"VOID":1362},"A5004609930",{"VOID":1364},"https:\u002F\u002Forcid.org\u002F0000-0001-5758-2556",{"EN":1366},"Enrico Giunchiglia",{"url":26,"publisher":1368,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1369,"slug":663,"properties":1370,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1375,"manageAffiliations":1376,"indexDatabases":1377,"url":26,"thumbnailPath":26,"statistic":1392,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1371,"eissn":1372,"title":1373,"url":1374},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[1378,1385],{"id":721,"indexDatabase":1379,"url":734,"indexYears":735,"academicFieldIds":1384,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":1380,"label":1381,"description":1382,"key":731,"publicationTags":1383,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":1386,"url":757,"indexYears":26,"academicFieldIds":1391,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":1387,"label":1388,"description":1389,"key":753,"publicationTags":1390,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":1393,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":1394,"totalCitation":768,"totalCitationByYear":1395,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":1396,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},153,{"total":1397,"publishYear":26,"statisticByYear":1399},{"2012":52,"2013":242,"2014":51,"2015":52,"2016":116,"2017":162,"2018":59,"2019":59,"2020":50,"2021":114,"2023":114,"2024":115},"2007-01-02","2024-04-14T00:13:46.391+00:00",[1403,1407,1411,1414,1417,1420,1423,1427,1431,1435,1439,1443,1447,1451,1454,1457,1461,1464,1467,1471,1475,1478,1482,1485,1489,1493,1497,1500,1504,1508,1511,1515,1518,1521,1525,1529,1532,1535,1539,1543,1546,1549,1552,1555,1559,1563,1566,1569,1573,1577,1581,1584,1588,1592,1596,1599,1603,1607,1610,1614,1617,1621,1624,1628,1631],{"id":26,"text":1404,"url":26,"identifiers":1405},"Armando, A., Castellini, C., Giunchiglia, E.: SAT-based procedures for temporal reasoning. In: Lecture Notes in Computer Science, vol. 1809, pp. 97–108 (1999)",{"doi":1406},"10.1007\u002F10720246_8",{"id":26,"text":1408,"url":26,"identifiers":1409},"Armando, A., Castellini, C., Giunchiglia, E., Maratea, M.: The SAT-based approach to separation logic. J. Autom. Reason. To appear (2005)",{"doi":1410},"10.1007\u002Fs10817-005-9002-1",{"id":26,"text":1412,"url":26,"identifiers":1413},"Babovich, Y., Erdem, E., Lifschitz, V.: ‘Fages’ theorem and answer set programming. In: Proc. NMR, (2000)",{},{"id":26,"text":1415,"url":26,"identifiers":1416},"Baral, C., Gelfond, M., Scherl, R.: ‘Using answer set programming to answer complex queries. In: Workshop on Pragmatics of Question Answering at HLT-NAAC2004, (2004)",{},{"id":26,"text":1418,"url":26,"identifiers":1419},"Barrett, C.W., Dill, D.L., Stump, A.: Checking satisfiability of first-order formulas by incremental Translation to SAT. In: Brinksma, E., Larsen, K.G. (eds.), 14th International Conference on Computer Aided Verification (CAV), vol. 2404 of Lecture Notes in Computer Science, pp. 236–249. Springer, Berlin Heidelberg New York (2002)",{},{"id":26,"text":1421,"url":26,"identifiers":1422},"Bayardo, R.J. Jr, Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97\u002FIAAI-97). Menlo Park, California, pp. 203–208. AAAI (1997)",{},{"id":26,"text":1424,"url":26,"identifiers":1425},"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Ann. Math. Artif. Intell. 12, 53–87 (1996)",{"doi":1426},"10.1007\u002FBF01530761",{"id":26,"text":1428,"url":26,"identifiers":1429},"Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.), Logic and Data Bases, pp. 293–322. Plenum, New York (1978)",{"doi":1430},"10.1007\u002F978-1-4684-3384-5_11",{"id":26,"text":1432,"url":26,"identifiers":1433},"Ştefănescu, A., Esparza, J., Muscholl, A.: Synthesis of distributed algorithms using asynchronous automata. In: Proc. CONCUR'03, vol. 2761, pp. 27–41. Springer (2003)",{"doi":1434},"10.1007\u002F978-3-540-45187-7_2",{"id":26,"text":1436,"url":26,"identifiers":1437},"Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem proving. Commun. ACM 5(7), 394–397 (1962)",{"doi":1438},"10.1145\u002F368273.368557",{"id":26,"text":1440,"url":26,"identifiers":1441},"de Moura, L., Rueß, H., Sorea, S.: Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov, A. (ed.), Automated Deduction – CADE-18, vol. 2392 of Lecture Notes in Computer Science, pp. 438–455. Springer (2002)",{"doi":1442},"10.1007\u002F3-540-45620-1_35",{"id":26,"text":1444,"url":26,"identifiers":1445},"Dixon, H.E., Ginsberg, M.L., Luks, E.M., Parkes, A.J.: Generalizing Boolean satisfiability II: Theory. J. Artif. Intell. Res. (JAIR) 22, 481–534 (2004)",{"doi":1446},"10.1613\u002Fjair.1555",{"id":26,"text":1448,"url":26,"identifiers":1449},"Dowling, W., Gallier, J.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 3, 267–284 (1984)",{"doi":1450},"10.1016\u002F0743-1066(84)90014-1",{"id":26,"text":1452,"url":26,"identifiers":1453},"Eén, N., Sörensson, N.: An extensible SAT-solver'. In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5–8, 2003 Selected Revised Papers, pp. 502–518, (2003)",{},{"id":26,"text":1455,"url":26,"identifiers":1456},"Erdem, E.: Theory and applications of answer set programming. Ph.D. thesis, University of Texas at Austin (2002)",{},{"id":26,"text":1458,"url":26,"identifiers":1459},"Erdem, E., Lifschitz, V.: ‘Fages’ theorem for programs with nested expressions. In: Proc. International Conference on Logic Programming, pp. 242–254, (2001)",{"doi":1460},"10.1007\u002F3-540-45635-X_24",{"id":26,"text":1462,"url":26,"identifiers":1463},"Faber, W., Leone, N., Pfeifer, G.: Experimenting with heuristics for answer set programming. In: IJCAI, pp. 635–640 (2001)",{},{"id":26,"text":1465,"url":26,"identifiers":1466},"Fages, F.: Consistency of Clark's completion and existence of stable models. J. Methods Logic Comput. Sci. 1, 51–60 (1994)",{},{"id":26,"text":1468,"url":26,"identifiers":1469},"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory and Practice of Logic Programming 5, 45–74 (2005)",{"doi":1470},"10.1017\u002FS1471068403001923",{"id":26,"text":1472,"url":26,"identifiers":1473},"Gebser, M., Schaub, T.: Loops: Relevant or redundant?. In: Proceedings of 8th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 53–65. Springer (2005)",{"doi":1474},"10.1007\u002F11546207_5",{"id":26,"text":1476,"url":26,"identifiers":1477},"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proceedings of the Fifth Int'l Conf. and Symp., pp. 1070–1080, (1988)",{},{"id":26,"text":1479,"url":26,"identifiers":1480},"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365–385 (1991)",{"doi":1481},"10.1007\u002FBF03037169",{"id":26,"text":1483,"url":26,"identifiers":1484},"Gent, I., Maaren, H.V., Walsh, T. (eds.) SAT 2000. Highlights of Satisfiability Research in the Year 2000. IOS (2000)",{},{"id":26,"text":1486,"url":26,"identifiers":1487},"Giunchiglia, E., Giunchiglia, F., Tacchella, A.: SAT-based decision procedures for classical modal logics. J. Autom. Reason. 28, 143–171 (2002). Reprinted in [23]",{"doi":1488},"10.1023\u002FA:1015071400913",{"id":26,"text":1490,"url":26,"identifiers":1491},"Giunchiglia, E., Maratea, M.: On the relation between SAT and ASP procedures (or, between smodels and cmodels). In: Proceedings of the 21th International Conference on Logic Programming (ICLP), pp. 37–51. Springer (2005a)",{"doi":1492},"10.1007\u002F11562931_6",{"id":26,"text":1494,"url":26,"identifiers":1495},"Giunchiglia, E., Maratea, M.: Evaluating search strategies and heuristics for efficient answer set programming. In: Advanced in Artificial Intelligence: Conference of the Italian Association for Artificial Intelligence, AI*IA '05, Milan, Italy, September 20–23, 2005, Proceedings, pp. 37–51. Springer (2005b)",{"doi":1496},"10.1007\u002F11558590_13",{"id":26,"text":1498,"url":26,"identifiers":1499},"Giunchiglia, E., Maratea, M., Lierler, Y.: SAT-based answer set programming. In: Proc. 19th National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, July 25-29, 2004, San Jose, California. AAAI, The MIT Press (2004)",{},{"id":26,"text":1501,"url":26,"identifiers":1502},"Giunchiglia, E., Maratea, M., Tacchella, A.: In: Effectiveness of look-ahead techniques in a modern SAT solver. In: 9th International Conference on Principles and Practice of Constraint Programming (CP-03), pp. 842–846, (2003)",{"doi":1503},"10.1007\u002F978-3-540-45193-8_64",{"id":26,"text":1505,"url":26,"identifiers":1506},"Giunchiglia, E., Maratea, M., Tacchella, A., Zambonin, D.: Evaluating search heuristics and optimization techniques in propositional satisfiability. In: Automated Reasoning, First International Joint Conference (IJCAR), vol. 2083 of Lecture Notes in Computer Science, pp. 347–363. Springer (2001)",{"doi":1507},"10.1007\u002F3-540-45744-5_26",{"id":26,"text":1509,"url":26,"identifiers":1510},"Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT solver. In: Proc. of the Design, Automation and Test in Europe Conference and Exposition 2003, pp. 142–149. IEEE Computer Society (2003)",{},{"id":26,"text":1512,"url":26,"identifiers":1513},"Heljanko, K., Niemelä, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3(4&5), 519–550 (2003). Also available as (CoRR: arXiv:cs.LO\u002F0305040)",{"doi":1514},"10.1017\u002FS1471068403001790",{"id":26,"text":1516,"url":26,"identifiers":1517},"Janhunen, T.: Translatability and intranslatability results for certain classes of logic programs'. Series A: Research report 82, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland (2003)",{},{"id":26,"text":1519,"url":26,"identifiers":1520},"Janhunen, T.: Representing normal programs with clauses. In: Proc. of 16th European Conference on Artificial Intelligence, ECAI 2004, pp. 358–362. IOS (2004)",{},{"id":26,"text":1522,"url":26,"identifiers":1523},"Janhunen, T., Niemelä, I.: GnT – A solver for disjunctive logic programming. In: Proc. of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), pp. 331–335. Springer (2004)",{"doi":1524},"10.1007\u002F978-3-540-24609-1_29",{"id":26,"text":1526,"url":26,"identifiers":1527},"Janhunen, T., Niemelä, I., Seipel, D., Simons, P., You, J.-H.: Unfolding partiality and disjuntion in stable model semantics. Accepted to the ACM Transaction on Computational Logic (2005)",{"doi":1528},"10.1145\u002F1119439.1119440",{"id":26,"text":1530,"url":26,"identifiers":1531},"Lahiri, S.K., Seshia, S.A., Bryant, R.E.: Modeling and verification of out-of-order microprocessors in UCLID. In: Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, Oregon, November 6–8, 2002, Proceedings, pp. 142–159 (2002)",{},{"id":26,"text":1533,"url":26,"identifiers":1534},"Le Berre, D., Simon, L.: The essentials of the SAT'03 Competition'. In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5–8, 2003 Selected Revised Papers, vol. 2919 of LNCS (2003)",{},{"id":26,"text":1536,"url":26,"identifiers":1537},"Lee, J., Lifschitz, V.: Loop formulas for disjunctive logic programs. In: Proc. ICLP-03, (2003)",{"doi":1538},"10.1007\u002F978-3-540-24599-5_31",{"id":26,"text":1540,"url":26,"identifiers":1541},"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. Accepted to ACM Transactions on Computational Logic (ToCL) (2005)",{"doi":1542},"10.1145\u002F1149114.1149117",{"id":26,"text":1544,"url":26,"identifiers":1545},"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97). San Francisco, pp. 366–371, Morgan Kaufmann (1997)",{},{"id":26,"text":1547,"url":26,"identifiers":1548},"Lierler, Y.: Disjunctive answer set programming via satisfiability. In: Answer Set Programming, vol. 142 of CEUR Workshop Proceedings (2005)",{},{"id":26,"text":1550,"url":26,"identifiers":1551},"Lierler, Y., Lifschitz, V.: Computing answer sets using program completion. Available at http:\u002F\u002Fwww.cs.utexas.edu\u002Fusers\u002Ftag\u002Fcmodels.html , 2003",{},{"id":26,"text":1553,"url":26,"identifiers":1554},"Lifschitz, V.: Foundations of logic programming. In: Brewka, G. (ed.), Principles of Knowledge Representation. CSLI, pp. 69–128, (1996)",{},{"id":26,"text":1556,"url":26,"identifiers":1557},"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic, 7, 261–268 (2006)",{"doi":1558},"10.1145\u002F1131313.1131316",{"id":26,"text":1560,"url":26,"identifiers":1561},"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25, 369–389 (1999)",{"doi":1562},"10.1023\u002FA:1018978005636",{"id":26,"text":1564,"url":26,"identifiers":1565},"Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proc. IJCAI (2003a)",{},{"id":26,"text":1567,"url":26,"identifiers":1568},"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT Solvers. In: Proc. 18th National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI\u002FIAAI-02). Menlo Park, California, pp. 112–118. AAAI (2002)",{},{"id":26,"text":1570,"url":26,"identifiers":1571},"Lin, F., Zhao, Y.: Answer set programming phase transition: A study on randomly generated programs. In: Proc. ICLP, (2003b)",{"doi":1572},"10.1007\u002F978-3-540-24599-5_17",{"id":26,"text":1574,"url":26,"identifiers":1575},"Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1–2), 115–137 (2004)",{"doi":1576},"10.1016\u002Fj.artint.2004.04.004",{"id":26,"text":1578,"url":26,"identifiers":1579},"Lloyd, J., Topor, R.: Making Prolog more expressive. J. Log. Program. 3, 225–240 (1984)",{"doi":1580},"10.1016\u002F0743-1066(84)90011-6",{"id":26,"text":1582,"url":26,"identifiers":1583},"Marek, V., Subrahmanian, V.: The relationship between logic program semantics and non-monotonic reasoning. In: Levi, G., Martelli, M. (eds.) Logic Programming: Proceedings of the 6th Int'l Conf., pp. 600–617, (1989)",{},{"id":26,"text":1585,"url":26,"identifiers":1586},"Marek, V., Truszczynski, M.: Stable models as an alternative programming paradigm. In: The Logic Programming Paradigm: A 25 Years perspective, Lecture Notes in Computer Science. Springer (1999)",{"doi":1587},"10.1007\u002F978-3-642-60085-2_17",{"id":26,"text":1589,"url":26,"identifiers":1590},"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. 38th Design Automation Conference (DAC'01), pp. 530–535 (2001)",{"doi":1591},"10.1145\u002F378239.379017",{"id":26,"text":1593,"url":26,"identifiers":1594},"Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)",{"doi":1595},"10.1023\u002FA:1018930122475",{"id":26,"text":1597,"url":26,"identifiers":1598},"Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Computer Aided Verification, 17th International Conference, CAV 2005, Edinburgh, Scotland, UK, July 6–10, 2005, Proceedings, pp. 321–334, (2005)",{},{"id":26,"text":1600,"url":26,"identifiers":1601},"Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog decision support system for the space shuttle. In: Working Notes of the AAAI Spring Symposium on Answer Set Programming, (2001)",{"doi":1602},"10.1007\u002F3-540-45241-9_12",{"id":26,"text":1604,"url":26,"identifiers":1605},"Plaisted, D., Greenbaum, S.: A structure-preserving clause form translation. J. Symbol. Comput. 2, 293–304 (1986)",{"doi":1606},"10.1016\u002FS0747-7171(86)80028-1",{"id":26,"text":1608,"url":26,"identifiers":1609},"Sheridan, D.: The Optimality of a Fast CNF Conversion and its use with SAT. In: Proceedings of SAT, International Conference on Theory and Applications of Satisfiability Testing, Vancouver (Canada) (2004)",{},{"id":26,"text":1611,"url":26,"identifiers":1612},"Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning: Classical Papers in Computational Logic 1967–1970, Vol. 1–2. Springer (1983)",{"doi":1613},"10.1007\u002F978-3-642-81952-0",{"id":26,"text":1615,"url":26,"identifiers":1616},"Silva, J.P.M., Sakallah, K.A.: GRASP – A New Search Algorithm for Satisfiability. Technical report, University of Michigan, (1996)",{},{"id":26,"text":1618,"url":26,"identifiers":1619},"Simons, P., Niemelä, I., Timo, S.: Extending and implementing the stable model semantics. Artif. Intell. 138(1–2), 181–234 (2002)",{"doi":1620},"10.1016\u002FS0004-3702(02)00187-X",{"id":26,"text":1622,"url":26,"identifiers":1623},"Syrjanen, T.: Lparse Manual. http:\u002F\u002Fwww.tcs.hut.fi\u002FSoftware\u002Fsmodels\u002Flparse.ps.gz , 2003",{},{"id":26,"text":1625,"url":26,"identifiers":1626},"Tseitin, G.: On the complexity of proofs in propositional logics. Semin. Math. 8 (1970). Reprinted in [59].",{"doi":1627},"10.1007\u002F978-1-4899-5327-8_25",{"id":26,"text":1629,"url":26,"identifiers":1630},"Ward, J., Schlipf, J.S.: Answer set programming with clause learning. In: Logic Programming and Nonmonotonic Reasoning, 7th International Conference, LPNMR 2004, Fort Lauderdale, Florida, January 6–8, 2004, Proceedings, pp. 302–313 (2004)",{},{"id":26,"text":1632,"url":26,"identifiers":1633},"Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: International Conference on Computer-Aided Design (ICCAD'01), pp. 279–285, (2001)",{},{"id":1635,"createTime":1636,"updateTime":1637,"relativeEntities":1638,"slug":1639,"properties":1640,"entityType":827,"verifyStatus":25,"verifyTime":1637,"verifyNote":828,"syncStatus":28,"languages":1651,"translateLanguages":26,"viewCount":36,"primaryUrl":1652,"fullTextUrl":26,"authors":1653,"publicationType":860,"publisherRelationship":1726,"citationCount":630,"citationInfo":1763,"publishDate":1765,"publishYear":1766,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":1767,"isForceReanalyzing":902},"180c11b0-42f6-48df-9f1d-29656e144235","2024-04-20T14:53:49.589+00:00","2025-01-20T19:34:23.643+00:00",[],"Closed-Form-Upper-Bounds-in-Static-Cost-Analysis",{"mag":1641,"keywords":1643,"openalex":1644,"abstract":1646,"title":1647,"doi":1649},{"VOID":1642},"2111366004",{},{"VOID":1645},"W2111366004",{},{"EN":1648},"Closed-Form Upper Bounds in Static Cost Analysis",{"VOID":1650},"10.1007\u002Fs10817-010-9174-1",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10817-010-9174-1",[1654,1673,1694,1711],{"id":1655,"sortIndex":59,"researcher":26,"roles":1656,"affiliations":1657,"properties":1668},"1e3109f8-d64e-48e5-8d09-87b5ba671342",[],[1658],{"id":1659,"sortIndex":36,"affiliation":1660,"properties":26},"8d9d7c83-c7c0-4756-a934-dec92829fbd8",{"id":1661,"createTime":1662,"updateTime":1662,"relativeEntities":1663,"slug":1664,"properties":1665,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"795226ab-f1e7-4054-bcde-32e3e64aa407","2024-04-20T14:53:49.646+00:00",[],"DLSIIS-Technical-University-of-Madrid-UPM-28660-Boadilla-del-Monte-Madrid-Spain",{"title":1666},{"EN":1667},"DLSIIS, Technical University of Madrid (UPM), 28660, Boadilla del Monte, Madrid, Spain",{"openalex":1669,"title":1671},{"VOID":1670},"A5038492725",{"EN":1672},"Germán Puebla",{"id":1674,"sortIndex":36,"researcher":26,"roles":1675,"affiliations":1676,"properties":1687},"cf7a7f2e-abaa-4de8-b5b4-f5887c137f1c",[],[1677],{"id":1678,"sortIndex":36,"affiliation":1679,"properties":26},"d9cb22d5-abf3-4948-93f6-a8e1512d35de",{"id":1680,"createTime":1681,"updateTime":1681,"relativeEntities":1682,"slug":1683,"properties":1684,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"580cd596-9381-413a-8028-debc5f5be05d","2024-04-20T14:53:49.631+00:00",[],"DSIC-Complutense-University-of-Madrid-UCM-28040-Madrid-Spain",{"title":1685},{"EN":1686},"DSIC, Complutense University of Madrid (UCM), 28040, Madrid, Spain",{"openalex":1688,"orcid":1690,"title":1692},{"VOID":1689},"A5091905437",{"VOID":1691},"https:\u002F\u002Forcid.org\u002F0000-0003-0048-0705",{"EN":1693},"Elvira Albert",{"id":1695,"sortIndex":114,"researcher":26,"roles":1696,"affiliations":1697,"properties":1704},"549f6bb9-fa5c-4ac0-a17c-7b67f7a9c917",[],[1698],{"id":1699,"sortIndex":36,"affiliation":1700,"properties":26},"05bf9a3a-cdb0-449b-a78f-e504ea49862f",{"id":1680,"createTime":1681,"updateTime":1681,"relativeEntities":1701,"slug":1683,"properties":1702,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1703},{"EN":1686},{"openalex":1705,"orcid":1707,"title":1709},{"VOID":1706},"A5014510097",{"VOID":1708},"https:\u002F\u002Forcid.org\u002F0000-0002-7176-1881",{"EN":1710},"Samir Genaim",{"id":1712,"sortIndex":115,"researcher":26,"roles":1713,"affiliations":1714,"properties":1721},"d812f440-4395-4e7a-ac58-828a8fa7810e",[],[1715],{"id":1716,"sortIndex":36,"affiliation":1717,"properties":26},"b06159f2-870b-4981-acc3-bcdafee67d70",{"id":1680,"createTime":1681,"updateTime":1681,"relativeEntities":1718,"slug":1683,"properties":1719,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":1720},{"EN":1686},{"openalex":1722,"title":1724},{"VOID":1723},"A5016308153",{"EN":1725},"Puri Arenas",{"url":26,"publisher":1727,"properties":1756},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":1728,"slug":663,"properties":1729,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":1734,"manageAffiliations":1735,"indexDatabases":1736,"url":26,"thumbnailPath":26,"statistic":1751,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":1730,"eissn":1731,"title":1732,"url":1733},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[1737,1744],{"id":721,"indexDatabase":1738,"url":734,"indexYears":735,"academicFieldIds":1743,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":1739,"label":1740,"description":1741,"key":731,"publicationTags":1742,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":1745,"url":757,"indexYears":26,"academicFieldIds":1750,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":1746,"label":1747,"description":1748,"key":753,"publicationTags":1749,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":1752,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":1753,"totalCitation":768,"totalCitationByYear":1754,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":1755,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},{"volume":1757,"pages":1759,"issue":1761},{"VOID":1758},"46",{"VOID":1760},"161-203",{"VOID":1762},"2",{"total":630,"publishYear":26,"statisticByYear":1764},{"2012":239,"2013":124,"2014":103,"2015":103,"2016":336,"2017":50,"2018":50,"2019":116,"2020":53,"2021":51,"2022":59,"2023":111},"2011-02-01",2011,[1768,1771,1775,1778,1782,1785,1789,1793,1797,1801,1805,1809,1813,1817,1820,1823,1827,1831,1835,1839,1843,1847,1851,1855,1859,1863,1867,1871,1875,1879,1883,1887,1891,1894,1898,1902,1906,1910,1914,1918,1922,1925,1929,1933,1937,1941,1945,1949,1953,1957,1961,1964,1968,1972],{"id":26,"text":1769,"url":26,"identifiers":1770},"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)",{},{"id":26,"text":1772,"url":26,"identifiers":1773},"Albert, E., Arenas, P., Codish, M., Genaim, S., Puebla, G., Zanardini, D.: Termination analysis of Java bytecode. In: 10th IFIP International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS’08). Lecture Notes in Computer Science, vol. 5051, pp. 2–18. Springer, Heidelberg (2008)",{"doi":1774},"10.1007\u002F978-3-540-68863-1_2",{"id":26,"text":1776,"url":26,"identifiers":1777},"Albert, E., Arenas, P., Genaim, S., Herraiz, I., Puebla, G.: Comparing cost functions in resource analysis. In: 1st International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA’09). Lecture Notes in Computer Science. Springer, Heidelberg (2009)",{},{"id":26,"text":1779,"url":26,"identifiers":1780},"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Automatic inference of upper bounds for recurrence relations in cost analysis. In: 15th International Symposium on Static Analysis (SAS’08). Lecture Notes in Computer Science, vol. 5079, pp. 221–237 (2008)",{"doi":1781},"10.1007\u002F978-3-540-69166-2_15",{"id":26,"text":1783,"url":26,"identifiers":1784},"Albert, E., Arenas, P., Genaim, S., Puebla, G.: Cost relation systems: a language–independent target language for cost analysis. In: 8th Spanish Conference on Programming and Computer Languages (PROLE’08), vol. 17615 of Electronic Notes in Theoretical Computer Science. Elsevier (2008)",{},{"id":26,"text":1786,"url":26,"identifiers":1787},"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of Java bytecode. In: 16th European Symposium on Programming, (ESOP’07). Lecture Notes in Computer Science, vol. 4421, pp. 157–172. Springer (2007)",{"doi":1788},"10.1007\u002F978-3-540-71316-6_12",{"id":26,"text":1790,"url":26,"identifiers":1791},"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: design and implementation of a cost and termination analyzer for Java bytecode. In: 6th International Symposioum on Formal Methods for Components and Objects (FMCO’08). Lecture Notes in Computer Science, no. 5382, pp. 113–133. Springer (2007)",{"doi":1792},"10.1007\u002F978-3-540-92188-2_5",{"id":26,"text":1794,"url":26,"identifiers":1795},"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Experiments in cost analysis of Java bytecode. In 2nd Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE’07), vol. 190, Issue 1 of Electronic Notes in Theoretical Computer Science. Elsevier (2007)",{"doi":1796},"10.1016\u002Fj.entcs.2007.02.061",{"id":26,"text":1798,"url":26,"identifiers":1799},"Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Resource usage analysis and its application to resource certification. In: 9th International School on Foundations of Security Analysis and Design (FOSAD’09). Lecture Notes in Computer Science, no. 5705, pp. 258–288. Springer (2009)",{"doi":1800},"10.1007\u002F978-3-642-03829-7_9",{"id":26,"text":1802,"url":26,"identifiers":1803},"Albert, E., Genaim, S., Gómez-Zamalloa, M.: Heap space analysis of Java bytecode. In: 6th International Symposium on Memory Management (ISMM’07), pp. 105–116. ACM Press (2007)",{"doi":1804},"10.1145\u002F1296907.1296922",{"id":26,"text":1806,"url":26,"identifiers":1807},"Albert, E., Genaim, S., Gómez-Zamalloa, M.: Live Heap space analysis for languages with garbage collection. In: 8th International Symposium on Memory management (ISMM’09). ACM Press (2009)",{"doi":1808},"10.1145\u002F1542431.1542450",{"id":26,"text":1810,"url":26,"identifiers":1811},"Aspinall, D., Gilmore, S., Hofmann, M., Sannella, D., Stark, I.: Mobile resource guarantees for smart devices. In: Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart Devices (CASSIS’04). Lecture Notes in Computer Science, vol. 3362, pp. 1–27. Springer (2005)",{"doi":1812},"10.1007\u002F978-3-540-30569-9_1",{"id":26,"text":1814,"url":26,"identifiers":1815},"Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1–2), 3–21 (2008)",{"doi":1816},"10.1016\u002Fj.scico.2007.08.001",{"id":26,"text":1818,"url":26,"identifiers":1819},"Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: towards computer algebra support for fully automatic worst-case complexity analysis. Technical report (2005). http:\u002F\u002FarXiv.org.\u002Fabs\u002Fcs\u002F0512056",{},{"id":26,"text":1821,"url":26,"identifiers":1822},"Batchelder, P.M.: An introduction to linear difference equations. Dover Publications (1967)",{},{"id":26,"text":1824,"url":26,"identifiers":1825},"Ben-Amram, A.M.: Size-change termination with difference constraints. ACM Trans. Program. Lang. Syst. 30(3), 31 (2008) (Article 16)",{"doi":1826},"10.1145\u002F1353445.1353450",{"id":26,"text":1828,"url":26,"identifiers":1829},"Ben-Amram, A.M., Jones, N.D., Kristiansen L.: Linear, polynomial or exponential? Complexity inference in polynomial time. In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, (CiE’08). Lecture Notes in Computer Science, vol. 5028, pp. 67–76. Springer (2008)",{"doi":1830},"10.1007\u002F978-3-540-69407-6_7",{"id":26,"text":1832,"url":26,"identifiers":1833},"Benzinger, R.: Automated higher-order complexity analysis. Theor. Comp. Sci. 318(1–2), 79–103 (2004)",{"doi":1834},"10.1016\u002Fj.tcs.2003.10.022",{"id":26,"text":1836,"url":26,"identifiers":1837},"Bonfante, G., Marion, J.-Y., Moyen, J.-Y.: Quasi-interpretations and small space bounds. In: 16th International Conference on Rewriting Techniques and Applications (RTA’05). Lecture Notes in Computer Science, vol. 3467, pp. 150–164 (2005)",{"doi":1838},"10.1007\u002F978-3-540-32033-3_12",{"id":26,"text":1840,"url":26,"identifiers":1841},"Braverman, M.: Termination of integer linear programs. In: 18th Computer Aided Verification (CAV’06). Lecture Notes in Computer Science, vol. 4144, pp. 372–385. Springer (2006)",{"doi":1842},"10.1007\u002F11817963_34",{"id":26,"text":1844,"url":26,"identifiers":1845},"Chander, A., Espinosa, D., Islam, N., Lee, P., Necula, G.: Enforcing resource bounds via static verification of dynamic checks. In: 14th European Symposium on Programming (ESOP’05). Lecture Notes in Computer Science, vol. 3444, pp. 311–325. Springer (2005)",{"doi":1846},"10.1007\u002F978-3-540-31987-0_22",{"id":26,"text":1848,"url":26,"identifiers":1849},"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: ACM Symposium on Principles of Programming Languages (POPL’77), pp. 238–252. ACM Press (1977)",{"doi":1850},"10.1145\u002F512950.512973",{"id":26,"text":1852,"url":26,"identifiers":1853},"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: ACM Symposium on Principles of Programming Languages (POPL’78), pp. 84–97. ACM Press (1978)",{"doi":1854},"10.1145\u002F512760.512770",{"id":26,"text":1856,"url":26,"identifiers":1857},"Craig, S.-J., Leuschel, M.: Self-tuning resource aware specialisation for prolog. In: 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP’05), pp. 23–34. ACM Press (2005)",{"doi":1858},"10.1145\u002F1069774.1069777",{"id":26,"text":1860,"url":26,"identifiers":1861},"Crary, K., Weirich, S.: Resource bound certification. In: 27th ACM Symposium on Principles of Programming Languages (POPL’05), pp. 184–198. ACM Press (2000)",{"doi":1862},"10.1145\u002F325694.325716",{"id":26,"text":1864,"url":26,"identifiers":1865},"Debray, S.K., Lin, N.W.: Cost Analysis of Logic Programs. ACM Trans. Program. Lang. Syst. 15(5), 826–875 (1993)",{"doi":1866},"10.1145\u002F161468.161472",{"id":26,"text":1868,"url":26,"identifiers":1869},"Floyd, R.W.: Assigning meanings to programs. In: Proceedings of Symposium in Applied Mathematics, vol. 19, Mathematical Aspects of Computer Science, pp. 19–32. American Mathematical Society, Providence, RI (1967)",{"doi":1870},"10.1090\u002Fpsapm\u002F019\u002F0235771",{"id":26,"text":1872,"url":26,"identifiers":1873},"Gómez, G., Liu, Y.A.: Automatic time-bound analysis for a higher-order language. In: Proceedings of the ACM SIGPLAN 2002 Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pp. 75–88. ACM Press (2002)",{"doi":1874},"10.1145\u002F503032.503039",{"id":26,"text":1876,"url":26,"identifiers":1877},"Hermenegildo, M., Puebla, G., Bueno, F., López-García, P.: Integrated program debugging, verification, and optimization using abstract interpretation (and The Ciao System Preprocessor). Sci. Comput. Program. 58(1–2), 115–140 (2005)",{"doi":1878},"10.1016\u002Fj.scico.2005.02.006",{"id":26,"text":1880,"url":26,"identifiers":1881},"Hickey, T., Cohen, J.: Automating program analysis. J. ACM 35(1), 185–220 (1988)",{"doi":1882},"10.1145\u002F42267.42275",{"id":26,"text":1884,"url":26,"identifiers":1885},"Hofmann, M., Jost, S.: Static prediction of heap space usage for first-order functional programs. In: 30th Symposium on Principles of Programming Languages (POPL’03), pp. 185–197. ACM Press, New York (2003)",{"doi":1886},"10.1145\u002F604131.604148",{"id":26,"text":1888,"url":26,"identifiers":1889},"Jaffar, J., Maher, M.J.: Constraint logic programming: a survey. J. Log. Program. 19\u002F20, 503–581 (1994)",{"doi":1890},"10.1016\u002F0743-1066(94)90033-7",{"id":26,"text":1892,"url":26,"identifiers":1893},"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial evaluation and automatic program generation. Prentice Hall, New York (1993)",{},{"id":26,"text":1895,"url":26,"identifiers":1896},"Komorovski, J.: An introduction to partial deduction. In: Meta Programming in Logic (META’92). Lecture Notes in Computer Science, vol. 649, pp. 49–69. Springer, Heidelberg (1992)",{"doi":1897},"10.1007\u002F3-540-56282-6_4",{"id":26,"text":1899,"url":26,"identifiers":1900},"Kristiansen, L., Jones, N.D.: The flow of data and the complexity of algorithms. In: 1st Conference on Computability in Europe (CiE’05). Lecture Notes in Computer Science, vol. 3526, pp. 263–274 (2005)",{"doi":1901},"10.1007\u002F11494645_33",{"id":26,"text":1903,"url":26,"identifiers":1904},"Le Metayer, D.: ACE: an automatic complexity evaluator. ACM Trans. Program. Lang. Syst. 10(2), 248–266 (1988)",{"doi":1905},"10.1145\u002F42190.42347",{"id":26,"text":1907,"url":26,"identifiers":1908},"Leuschel, M.: A framework for the integration of partial evaluation and abstract interpretation of logic programs. ACM Trans. Program. Lang. Syst. 26(3), 413–463 (2004)",{"doi":1909},"10.1145\u002F982158.982159",{"id":26,"text":1911,"url":26,"identifiers":1912},"Leuschel, M., Bruynooghe, M.: Logic program specialisation through partial deduction: control issues. Theory Pract. Log. Program. 2(4 & 5), 461–515 (2002)",{"doi":1913},"10.1017\u002FS147106840200145X",{"id":26,"text":1915,"url":26,"identifiers":1916},"Lloyd, J.W., Shepherdson, J.C.: Partial evaluation in logic programming. J. Log. Program. 11(3–4), 217–242 (1991)",{"doi":1917},"10.1016\u002F0743-1066(91)90027-M",{"id":26,"text":1919,"url":26,"identifiers":1920},"Luca, B., Andrei, S., Anderson, H., Khoo, S.-C.: Program transformation by solving recurrences. In: ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation (PEPM ’06), pp. 121–129. ACM (2006)",{"doi":1921},"10.1145\u002F1111542.1111563",{"id":26,"text":1923,"url":26,"identifiers":1924},"Marion, J.-Y., Péchoux, R.: Sup-interpretations, a semantic method for static analysis of program resources. ACM Trans. Comput. Log. 10(4), 31 (2009) (Article 27)",{},{"id":26,"text":1926,"url":26,"identifiers":1927},"Navas, J., Mera, E., López-García, P., Hermenegildo, M.: User-definable resource bounds analysis for logic programs. In: 23rd International Conference on Logic Programming (ICLP’07), vol. 4670 of LNCS, pp. 348–363. Springer, Heidelberg (2007)",{"doi":1928},"10.1007\u002F978-3-540-74610-2_24",{"id":26,"text":1930,"url":26,"identifiers":1931},"Necula, G.: Proof-carrying code. In: ACM Symposium on Principles of Programming Languages (POPL 1997), pp. 106–119. ACM Press, New York (1997)",{"doi":1932},"10.1145\u002F263699.263712",{"id":26,"text":1934,"url":26,"identifiers":1935},"Niggl, K.-H., Wunderlich, H.: Certifying polynomial time and linear\u002Fpolynomial space for imperative programs. SIAM J. Comput. 35(5), 1122–1147 (2006)",{"doi":1936},"10.1137\u002FS0097539704445597",{"id":26,"text":1938,"url":26,"identifiers":1939},"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: 5th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI’04). Lecture Notes in Computer Science, pp. 239–251. Springer, Heidelberg (2004)",{"doi":1940},"10.1007\u002F978-3-540-24622-0_20",{"id":26,"text":1942,"url":26,"identifiers":1943},"Puebla, G., Ochoa, C.: Poly-controlled partial evaluation. In: 8th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming (PPDP’06), pp. 261–271. ACM Press, New York (2006)",{"doi":1944},"10.1145\u002F1140335.1140366",{"id":26,"text":1946,"url":26,"identifiers":1947},"Rosendahl, M.: Automatic complexity analysis. In: 4th ACM Conference on Functional Programming Languages and Computer Architecture (FPCA’89), pp. 144–156. ACM Press (1989)",{"doi":1948},"10.1145\u002F99370.99381",{"id":26,"text":1950,"url":26,"identifiers":1951},"Rosendahl, M.: Simple driving techniques. In: Mogensen, T., Schmidt, D., Hal Sudborough, I. (eds.) The Essence of Computation. Lecture Notes in Computer Science, vol. 2566, pp. 404–419. Springer, Heidelberg (2002)",{"doi":1952},"10.1007\u002F3-540-36377-7_18",{"id":26,"text":1954,"url":26,"identifiers":1955},"Sands, D.: A naïve time analysis and its theory of cost equivalence. J. Log. Comput. 5(4), 495–541 (1995)",{"doi":1956},"10.1093\u002Flogcom\u002F5.4.495",{"id":26,"text":1958,"url":26,"identifiers":1959},"Shamir, A.: A linear time algorithm for finding minimum cutsets in reducible graphs. SIAM J. Comput. 8(4), 645–655 (1979)",{"doi":1960},"10.1137\u002F0208051",{"id":26,"text":1962,"url":26,"identifiers":1963},"Spoto, F., Hill, P.M., Payet, E.: Path-length analysis of object-oriented programs. In: 1st International Workshop on Emerging Applications of Abstract Interpretation (EAAI’06), Electronic Notes in Theoretical Computer Science. Elsevier, Amsterdam (2006)",{},{"id":26,"text":1965,"url":26,"identifiers":1966},"Turchin, V.F.: The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8(3), 292–325 (1986)",{"doi":1967},"10.1145\u002F5956.5957",{"id":26,"text":1969,"url":26,"identifiers":1970},"Wadler, P.: Strictness analysis aids time analysis. In: ACM Symposium on Principles of Programming Languages (POPL’88), pp. 119–132. ACM Press (1988)",{"doi":1971},"10.1145\u002F73560.73571",{"id":26,"text":1973,"url":26,"identifiers":1974},"Wegbreit, B.: Mechanical program analysis. Commun. ACM 18(9), 69–73 (1975)",{"doi":1975},"10.1145\u002F361002.361016",{"id":1977,"createTime":1978,"updateTime":1979,"relativeEntities":1980,"slug":1981,"properties":1982,"entityType":827,"verifyStatus":25,"verifyTime":1979,"verifyNote":828,"syncStatus":28,"languages":1993,"translateLanguages":26,"viewCount":36,"primaryUrl":1994,"fullTextUrl":26,"authors":1995,"publicationType":860,"publisherRelationship":2049,"citationCount":2079,"citationInfo":2080,"publishDate":1143,"publishYear":1144,"citationAnalyzeStatus":975,"lastCitationAnalyze":2082,"indexDatabases":26,"openAccess":26,"references":2083,"isForceReanalyzing":902},"dce2ce98-5271-48cf-aaa8-d40098dbc329","2024-04-11T17:35:18.543+00:00","2025-02-09T11:15:10.973+00:00",[],"Reasoning-in-Description-Logics-by-a-Reduction-to-Disjunctive-Datalog",{"mag":1983,"keywords":1985,"openalex":1986,"abstract":1988,"title":1989,"doi":1991},{"VOID":1984},"2107910552",{},{"VOID":1987},"W2107910552",{},{"EN":1990},"Reasoning in Description Logics by a Reduction to Disjunctive Datalog",{"VOID":1992},"10.1007\u002Fs10817-007-9080-3",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10817-007-9080-3",[1996,2017,2033],{"id":1997,"sortIndex":36,"researcher":26,"roles":1998,"affiliations":1999,"properties":2010},"7eda5cc7-d7bf-46a1-ae89-02059ab854ba",[],[2000],{"id":26,"sortIndex":36,"affiliation":2001,"properties":26},{"id":2002,"createTime":2003,"updateTime":2004,"relativeEntities":2005,"slug":2006,"properties":2007,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"cb4f2eac-3dbb-4bd0-86ba-52863d84eaa6","2024-01-15T00:23:51.434+00:00","2024-10-05T19:05:03.097+00:00",[],"Department-of-Computer-Science-University-of-Liverpool-Liverpool-UK",{"title":2008},{"VI":2009},"Department of Computer Science, University of Liverpool, Liverpool, UK",{"openalex":2011,"orcid":2013,"title":2015},{"VOID":2012},"A5076121047",{"VOID":2014},"https:\u002F\u002Forcid.org\u002F0000-0002-0455-0267",{"EN":2016},"Ullrich Hustadt",{"id":2018,"sortIndex":114,"researcher":26,"roles":2019,"affiliations":2020,"properties":2029},"e68a9d7f-1b40-429d-b49a-6e333d596560",[],[2021],{"id":26,"sortIndex":36,"affiliation":2022,"properties":26},{"id":2023,"createTime":2024,"updateTime":2024,"relativeEntities":2025,"slug":26,"properties":2026,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b9bc2610-78f3-4aa5-aa1b-b2f0c18fd98a","2024-01-14T06:09:45.461+00:00",[],{"title":2027},{"VI":2028},"Department of Computer Science, University of Manchester, Manchester, UK",{"openalex":2030,"orcid":2031,"title":2032},{"VOID":1085},{"VOID":1087},{"EN":1089},{"id":2034,"sortIndex":115,"researcher":26,"roles":2035,"affiliations":2036,"properties":2042},"7ee04144-ac71-46ac-b1f6-00d511f83fbb",[],[2037],{"id":26,"sortIndex":36,"affiliation":2038,"properties":26},{"id":2023,"createTime":2024,"updateTime":2024,"relativeEntities":2039,"slug":26,"properties":2040,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2041},{"VI":2028},{"openalex":2043,"orcid":2045,"title":2047},{"VOID":2044},"A5077636035",{"VOID":2046},"https:\u002F\u002Forcid.org\u002F0000-0003-2506-4118",{"EN":2048},"Boris Motik",{"url":26,"publisher":2050,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2051,"slug":663,"properties":2052,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2057,"manageAffiliations":2058,"indexDatabases":2059,"url":26,"thumbnailPath":26,"statistic":2074,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2053,"eissn":2054,"title":2055,"url":2056},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[2060,2067],{"id":721,"indexDatabase":2061,"url":734,"indexYears":735,"academicFieldIds":2066,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":2062,"label":2063,"description":2064,"key":731,"publicationTags":2065,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":2068,"url":757,"indexYears":26,"academicFieldIds":2073,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":2069,"label":2070,"description":2071,"key":753,"publicationTags":2072,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":2075,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":2076,"totalCitation":768,"totalCitationByYear":2077,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":2078,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},149,{"total":2079,"publishYear":26,"statisticByYear":2081},{"2012":173,"2013":356,"2014":51,"2015":103,"2016":50,"2017":50,"2018":158,"2019":356,"2020":52,"2021":115,"2022":114,"2023":115,"2024":115},"2024-04-11T20:35:53.630+00:00",[2084,2087,2090,2093,2097,2101,2105,2109,2113,2116,2120,2124,2128,2132,2136,2139,2143,2147,2151,2154,2157,2161,2164,2168,2171,2174,2178,2182,2185,2189,2193,2197,2201,2204,2207,2210,2213,2217,2220],{"id":26,"text":2085,"url":26,"identifiers":2086},"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley, Reading, MA (1995)",{},{"id":26,"text":2088,"url":26,"identifiers":2089},"Alsaç, G., Baral, C.: Reasoning in description logics using declarative logic programming. Technical report, Arizona State University, Arizona. http:\u002F\u002Fwww.public.asu.edu\u002F~cbaral\u002Fpapers\u002Fdescr-logic-aaai2.pdf (2002)",{},{"id":26,"text":2091,"url":26,"identifiers":2092},"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge, MA (2003)",{},{"id":26,"text":2094,"url":26,"identifiers":2095},"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, MA (1998)",{"doi":2096},"10.1017\u002FCBO9781139172752",{"id":26,"text":2098,"url":26,"identifiers":2099},"Baaz, M., Egly, U., Leitsch, A.: Normal form transformations. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I. Chapt. 5, pp. 273–333. Elsevier Science, Amsterdam (2001)",{"doi":2100},"10.1016\u002FB978-044450813-3\u002F50007-2",{"id":26,"text":2102,"url":26,"identifiers":2103},"Bachmair, L., Ganzinger, H., Lynch, C., Snyder, W.: Basic paramodulation. Inf. Comput. 121(2), 172–192 (1995)",{"doi":2104},"10.1006\u002Finco.1995.1131",{"id":26,"text":2106,"url":26,"identifiers":2107},"Beeri, C., Ramakrishnan, R.: On the power of magic. In: Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS ’87), pp. 269–283. San Diego, CA, USA (1987)",{"doi":2108},"10.1145\u002F28659.28689",{"id":26,"text":2110,"url":26,"identifiers":2111},"Borgida, A.: On the relative expressiveness of description logics and predicate logics. Artif. Intell. 82(1–2), 353–367 (1996)",{"doi":2112},"10.1016\u002F0004-3702(96)00004-5",{"id":26,"text":2114,"url":26,"identifiers":2115},"Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proceedings of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006), pp. 260–270. Lake District, UK (2006)",{},{"id":26,"text":2117,"url":26,"identifiers":2118},"Calvanese, D., Lenzerini, M., Nardi, D.: Description logics for conceptual data modeling. In: Chomicki, J., Saake, G. (eds.) Logics for Databases and Information Systems, Chapt. 8, pp. 229–263. Kluwer, Boston, MA (1998)",{"doi":2119},"10.1007\u002F978-1-4615-5643-5_8",{"id":26,"text":2121,"url":26,"identifiers":2122},"Chen, P.P.: The entity-relationship model – toward a unified view of data. ACM Trans. Database Syst. 1(1), 9–36 (1976)",{"doi":2123},"10.1145\u002F320434.320440",{"id":26,"text":2125,"url":26,"identifiers":2126},"Cumbo, C., Faber, W., Greco, G., Leone, N.: Enhancing the magic-set method for disjunctive datalog programs. In: Demoen, B., Lifschitz, V. (eds.) Proceedings of the 20th Int. Conf. on Logic Programming (ICLP 2004), LNCS, vol. 3132, pp. 371–385. Saint-Malo, France (2004)",{"doi":2127},"10.1007\u002F978-3-540-27775-0_26",{"id":26,"text":2129,"url":26,"identifiers":2130},"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374–425 (2001)",{"doi":2131},"10.1145\u002F502807.502810",{"id":26,"text":2133,"url":26,"identifiers":2134},"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364–418 (1997)",{"doi":2135},"10.1145\u002F261124.261126",{"id":26,"text":2137,"url":26,"identifiers":2138},"Fitting, M.: First-order logic and theorem proving. In: Texts in Computer Science, 2nd edn. Springer, Berlin Heidelberg New York (1996)",{},{"id":26,"text":2140,"url":26,"identifiers":2141},"Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proceedings of the 12th Int. World Wide Web Conference (WWW 2003), pp. 48–57. Budapest, Hungary (2003)",{"doi":2142},"10.1145\u002F775152.775160",{"id":26,"text":2144,"url":26,"identifiers":2145},"Haarslev, V., Möller, R.,: RACER system description. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) Proceedings of the 1st Int. Joint Conf. on Automated Reasoning (IJCAR 2001), LNAI, vol. 2083, pp. 701–706. Siena, Italy (2001)",{"doi":2146},"10.1007\u002F3-540-45744-5_59",{"id":26,"text":2148,"url":26,"identifiers":2149},"Haarslev, V., Möller, R., Turhan, A.-Y.: Exploiting pseudo models for TBox and ABox reasoning in expressive description logics. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) Proceedings of the 1st Int. Joint Conf. on Automated Reasoning (IJCAR 2001), LNAI, vol. 2083, pp. 61–75. Siena, Italy (2001)",{"doi":2150},"10.1007\u002F3-540-45744-5_6",{"id":26,"text":2152,"url":26,"identifiers":2153},"Heymans, S., Vermeir, D.: Integrating semantic web reasoning and answer set programming. In: Vos, M.D., Provetti, A. (eds.) Proceedings of the 2nd Int. Workshop on Answer Set Programming, Advances in Theory and Implementation (ASP’03), CEUR Workshop Proceedings, vol. 78, pp. 194–208. Messina, Italy (2003)",{},{"id":26,"text":2155,"url":26,"identifiers":2156},"Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From SHIQ and RDF to OWL: the making of a web ontology language. J. Web Sem. 1(1), 7–26 (2003)",{"doi":1224},{"id":26,"text":2158,"url":26,"identifiers":2159},"Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Log. J. IGPL 8(3), 239–263 (2000)",{"doi":2160},"10.1093\u002Fjigpal\u002F8.3.239",{"id":26,"text":2162,"url":26,"identifiers":2163},"Hustadt, U., Motik, B., Sattler, U.: Reducing $\\mathcal{SHIQ}^-$ description logic to disjunctive datalog programs. In: Dubois, D., Welty, C.A., Williams, M.-A. (eds.) Proceedings of the 9th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2004), pp. 152–162. Whistler, Canada (2004)",{},{"id":26,"text":2165,"url":26,"identifiers":2166},"Hustadt, U., Motik, B., Sattler, U.: A decomposition rule for decision procedures by resolution-based calculi. In: Baader, F., Voronkov, A. (eds.) Proceedings of the 11th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2004), LNAI, vol. 3452, pp. 21–35. Montevideo, Uruguay (2005a)",{"doi":2167},"10.1007\u002F978-3-540-32275-7_2",{"id":26,"text":2169,"url":26,"identifiers":2170},"Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proceedings of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 466–471. Edinburgh, UK (2005b)",{},{"id":26,"text":2172,"url":26,"identifiers":2173},"Hustadt, U., Schmidt, R.A.: On the relation of resolution and tableaux proof systems for description logics. In: Thomas, D. (ed.) Proceedings of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI ’99), pp. 110–115. Stockholm, Sweden (1999)",{},{"id":26,"text":2175,"url":26,"identifiers":2176},"Kazakov, Y., de Nivelle, H.: A resolution decision procedure for the guarded fragment with transitive guards. In: Basin, D., Rusinowitch, M. (eds.) Proceedings of the 2nd Int. Joint Conf. on Automated Reasoning (IJCAR 2004), LNAI, vol. 3097, pp. 122–136. Cork, Ireland (2004)",{"doi":2177},"10.1007\u002F978-3-540-25984-8_7",{"id":26,"text":2179,"url":26,"identifiers":2180},"Kazakov, Y., Motik, B.: A resolution-based decision procedure for $\\mathcal{SHIQ}$ . In: Furbach, U., Harrison, J., Shankar, N. (eds.) Proceedings of the 3rd Int. Joint Conf. on Automated Reasoning (IJCAR 2006), LNAI, vol. 4130, pp. 662–667. Seattle, WA (2006)",{"doi":2181},"10.1007\u002F11814771_53",{"id":26,"text":2183,"url":26,"identifiers":2184},"Motik, B.: Reasoning in description logics using resolution and deductive databases. Ph.D. thesis, Univesität Karlsruhe, Germany (2006)",{},{"id":26,"text":2186,"url":26,"identifiers":2187},"Motik, B., Sattler, U.: A comparison of reasoning techniques for querying large description logic ABoxes. In: Hermann, M., Voronkov, A. (eds.) Proceedings of the 13th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR 2006), pp. 227–241. Phnom Penh, Cambodia (2006), (accepted for publication)",{"doi":2188},"10.1007\u002F11916277_16",{"id":26,"text":2190,"url":26,"identifiers":2191},"Nebel, B.: Terminological cycles: semantics and computational properties. In: Sowa, J.F. (ed.) Principles of Semantic Networks: Explorations in the Representation of Knowledge, pp. 331–361. Morgan Kaufmann, San Mateo, CA (1991)",{"doi":2192},"10.1016\u002FB978-1-4832-0771-1.50018-7",{"id":26,"text":2194,"url":26,"identifiers":2195},"Nieuwenhuis, R., Rubio, A.: Theorem proving with ordering and equality constrained clauses. J. Symb. Comput. 19(4), 312–351 (1995)",{"doi":2196},"10.1006\u002Fjsco.1995.1020",{"id":26,"text":2198,"url":26,"identifiers":2199},"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I. Chapt. 6, pp. 335–367. Elsevier, Amsterdam (2001)",{"doi":2200},"10.1016\u002FB978-044450813-3\u002F50008-4",{"id":26,"text":2202,"url":26,"identifiers":2203},"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading, MA (1993)",{},{"id":26,"text":2205,"url":26,"identifiers":2206},"Parsia, B., Sirin, E.: Pellet: an OWL-DL reasoner. Poster, In: Proceedings of the 3rd Int. Semantic Web Conference (ISWC 2004), Hiroshima, Japan, 7–11 November (2004)",{},{"id":26,"text":2208,"url":26,"identifiers":2209},"Plaisted, D.A., Greenbaum, S.: A structure-preserving clause form translation. J. Symb. Comput. 2(3), 293–304 (1996)",{"doi":1606},{"id":26,"text":2211,"url":26,"identifiers":2212},"Schaerf, A.: Query answering in concept-based knowledge representation systems: algorithms, complexity, and semantic issues. Ph.D. thesis, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza,” Italy (1994)",{},{"id":26,"text":2214,"url":26,"identifiers":2215},"Swift, T.: Deduction in ontologies via ASP. In: Lifschitz, V., Niemelä, I. (eds.) Proceedings of the 7th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR 2004), LNCS, vol. 2923, pp. 275–288. Fort Lauderdale, FL (2004)",{"doi":2216},"10.1007\u002F978-3-540-24609-1_24",{"id":26,"text":2218,"url":26,"identifiers":2219},"Tobies, S.: Complexity results and practical algorithms for logics in knowledge representation. Ph.D. thesis, RWTH Aachen, Germany (2001)",{},{"id":26,"text":2221,"url":26,"identifiers":2222},"Tsarkov, D., Horrocks, I.: FaCT++ description logic reasoner: system description. In: Proceedings of the 3rd Int. Joint Conf. on Automated Reasoning (IJCAR 2006), LNAI, vol. 4130, pp. 292–297. Seattle, WA (2006)",{"doi":2223},"10.1007\u002F11814771_26",{"id":2225,"createTime":2226,"updateTime":2227,"relativeEntities":2228,"slug":2229,"properties":2230,"entityType":827,"verifyStatus":25,"verifyTime":2227,"verifyNote":828,"syncStatus":28,"languages":2241,"translateLanguages":26,"viewCount":36,"primaryUrl":2242,"fullTextUrl":26,"authors":2243,"publicationType":860,"publisherRelationship":2285,"citationCount":243,"citationInfo":2321,"publishDate":2323,"publishYear":2324,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2325,"isForceReanalyzing":902},"d23474c8-afd1-4892-b066-aa6b8f1a3bd4","2024-04-20T11:21:18.789+00:00","2025-02-18T17:17:54.569+00:00",[],"Embedding-defaults-into-terminological-knowledge-representation-formalisms",{"mag":2231,"keywords":2233,"openalex":2234,"abstract":2236,"title":2237,"doi":2239},{"VOID":2232},"2999843026",{},{"VOID":2235},"W2999843026",{},{"EN":2238},"Embedding defaults into terminological knowledge representation formalisms",{"VOID":2240},"10.1007\u002Fbf00883932",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF00883932",[2244,2264],{"id":2245,"sortIndex":115,"researcher":26,"roles":2246,"affiliations":2247,"properties":2259},"98ac18d7-d941-4702-8686-1a8678a35e34",[],[2248],{"id":2249,"sortIndex":36,"affiliation":2250,"properties":26},"605b138f-a48d-46d0-94ae-89f341daec5b",{"id":2251,"createTime":2252,"updateTime":2253,"relativeEntities":2254,"slug":2255,"properties":2256,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"e1cf075d-2469-46d1-965e-0a3e9a2c222b","2024-04-20T11:21:18.809+00:00","2024-06-02T21:17:16.703+00:00",[],"Deutsches-Forschungszentrum-f%C3%BCr-KI-DFKI-Saarbr%C3%BCcken-Germany",{"title":2257},{"EN":2258},"Deutsches Forschungszentrum für KI (DFKI), Saarbrücken, Germany",{"openalex":2260,"title":2262},{"VOID":2261},"A5044197008",{"EN":2263},"Bernhard Hollunder",{"id":2265,"sortIndex":36,"researcher":26,"roles":2266,"affiliations":2267,"properties":2278},"53c1510a-1f4e-492c-a872-b19ee2237b4a",[],[2268],{"id":2269,"sortIndex":36,"affiliation":2270,"properties":26},"d7039943-6145-4842-9948-1a09b3083ecb",{"id":2271,"createTime":2272,"updateTime":2272,"relativeEntities":2273,"slug":2274,"properties":2275,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"fb73f3ac-1bea-4eb1-8c12-c78f53bf9e4a","2024-04-18T03:26:33.230+00:00",[],"Lehr-und-Forschungsgebiet-Theoretische-Informatik-RWTH-Aachen-Ahornstra%C3%9Fe-55-52074-Aachen-Germany",{"title":2276},{"EN":2277},"Lehr- und Forschungsgebiet Theoretische Informatik, RWTH Aachen, Ahornstraße 55, 52074, Aachen, Germany",{"openalex":2279,"orcid":2281,"title":2283},{"VOID":2280},"A5086254817",{"VOID":2282},"https:\u002F\u002Forcid.org\u002F0000-0002-4049-221X",{"EN":2284},"Franz Baader",{"url":26,"publisher":2286,"properties":2315},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2287,"slug":663,"properties":2288,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2293,"manageAffiliations":2294,"indexDatabases":2295,"url":26,"thumbnailPath":26,"statistic":2310,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2289,"eissn":2290,"title":2291,"url":2292},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[2296,2303],{"id":721,"indexDatabase":2297,"url":734,"indexYears":735,"academicFieldIds":2302,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":2298,"label":2299,"description":2300,"key":731,"publicationTags":2301,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":2304,"url":757,"indexYears":26,"academicFieldIds":2309,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":2305,"label":2306,"description":2307,"key":753,"publicationTags":2308,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":2311,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":2312,"totalCitation":768,"totalCitationByYear":2313,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":2314,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},{"volume":2316,"pages":2318,"issue":2320},{"VOID":2317},"14",{"VOID":2319},"149-180",{"VOID":893},{"total":243,"publishYear":26,"statisticByYear":2322},{"2012":114,"2013":135,"2014":135,"2015":158,"2016":158,"2017":111,"2018":59,"2019":116,"2020":135,"2021":115,"2022":114,"2023":115},"1995-01-01",1995,[2326,2329,2332,2335,2338,2341,2344,2347,2351,2355,2358,2362,2366,2369,2372,2375,2378,2382,2385,2389,2393,2396,2399,2402,2405,2408,2412,2416,2420,2423,2427],{"id":26,"text":2327,"url":26,"identifiers":2328},"Baader, F. and Hanschke, P.: A Scheme for Integrating Concrete Domains into Concept Languages. Research Report RR-91-10, DFKI Kaiserslautern, 1991.",{},{"id":26,"text":2330,"url":26,"identifiers":2331},"Baader, F. and Hanschke, P.: A scheme for integrating concrete domains into concept languages, inProc. 12th Internat. Joint Conf. on Artificial Intelligence, Sydney, Australia, 1991.",{},{"id":26,"text":2333,"url":26,"identifiers":2334},"Baader, F. and Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms, inProc. 3rd Internat. Conf. on Principles of Knowledge Representation and Reasoning, Cambridge, MA, 1992.",{},{"id":26,"text":2336,"url":26,"identifiers":2337},"Baader, F. and Hollunder, B.: How to prefer more specific defaults in terminological default logic, inProc. 13th Internat. Joint Conf. on Artificial Intelligence, Chambery, France, 1993.",{},{"id":26,"text":2339,"url":26,"identifiers":2340},"Baader, F. and Schlechta, K.: A Semantics for Open Normal Defaults via a Modified Preferential Approach. Research Report RR-93-13, DFKI Saarbrücken, 1993. Also inProc. European Conf. on Symbolic and Quantitative Approaches to Reasoning under Uncertainty, Granada, Spain, 1993.",{},{"id":26,"text":2342,"url":26,"identifiers":2343},"Brachman, R. J.: ?I lied about the trees? or, defaults and definitions in knowledge representation,The AI Magazine 6(3) (1985), 80?93.",{},{"id":26,"text":2345,"url":26,"identifiers":2346},"Brachman, R. J., McGuinness, D. L., Patel-Schneider, P. F., Resnick, L. A. and Borgida, A.: Living with CLASSIC: When and how to use a KL-ONE-like language, in J. Sowa (ed.),Principles of Semantic Networks, Morgan Kaufmann, San Mateo, CA, 1991, pp. 401?456.",{"doi":1169},{"id":26,"text":2348,"url":26,"identifiers":2349},"Brachman, R. J. and Schmolze, J. G.: An overview of the KL-ONE knowledge representation system,Cognitive Science 9(2) (1985), 171?216.",{"doi":2350},"10.1207\u002Fs15516709cog0902_1",{"id":26,"text":2352,"url":26,"identifiers":2353},"Doyle, J.: A truth maintenance system,Artificial Intelligence 12 (1979), 231?272.",{"doi":2354},"10.1016\u002F0004-3702(79)90008-0",{"id":26,"text":2356,"url":26,"identifiers":2357},"Garey, M. and Johnson, D.:Computers and Intractability ? A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.",{},{"id":26,"text":2359,"url":26,"identifiers":2360},"Gottlob, G.: Complexity results for nonmonotonic logics,J. Logic and Computation 2(3) (1992), 397?425.",{"doi":2361},"10.1093\u002Flogcom\u002F2.3.397",{"id":26,"text":2363,"url":26,"identifiers":2364},"Hollunder, B.: Hybrid inferences in KL-ONE-based knowledge representation systems, in14th German Workshop on Artificial Intelligence, Ebingerfeld, Germany, Vol. 251 ofInformatik-Fachberichte, Springer, 1990, pp. 38?47.",{"doi":2365},"10.1007\u002F978-3-642-76071-6_5",{"id":26,"text":2367,"url":26,"identifiers":2368},"Hollunder, B. and Nutt, W.: Subsumption Algorithms for Concept Languages. Research Report RR-90-04, DFKI Kaiserslautern, 1990.",{},{"id":26,"text":2370,"url":26,"identifiers":2371},"Junker, U. and Konolige, K.: Computing extensions of autoepistemic and default logics with a truth maintenance system, inProc. 8th National Conf. on Artificial Intelligence, Boston, MA, 1990.",{},{"id":26,"text":2373,"url":26,"identifiers":2374},"Kautz, H. A. and Selman, B.: Hard problems for simple defaults, inProc. 1st Internat. Conf. on Principles of Knowledge Representation and Reasoning, Toronto, Ont., 1989.",{},{"id":26,"text":2376,"url":26,"identifiers":2377},"Kobsa, A.: The SB-ONE knowledge representation workbench, inPreprints of the Workshop on Formal Aspects of Semantic Networks, Two Habours, CA, 1989.",{},{"id":26,"text":2379,"url":26,"identifiers":2380},"Lifschitz, V.: On open defaults, inProc. Symp. on Computational Logics, Brüssel, Belgium, 1990.",{"doi":2381},"10.1007\u002F978-3-642-76274-1_3",{"id":26,"text":2383,"url":26,"identifiers":2384},"Mays, E. and Dionne, B.: Making KR systems useful, inTerminological Logic Users Workshop ? Proceedings, KIT-Report 95, TU Berlin, 1991, pp. 11?12.",{},{"id":26,"text":2386,"url":26,"identifiers":2387},"MaCarthy, J.: Circumscription ? a form of non-monotonic reasoning,Artificial Intelligence 13 (1980), 27?39.",{"doi":2388},"10.1016\u002F0004-3702(80)90011-9",{"id":26,"text":2390,"url":26,"identifiers":2391},"McDermott, D. and Doyle, J.: Non-monotonic logic I,Artificial Intelligence 13 (1980), 41?72.",{"doi":2392},"10.1016\u002F0004-3702(80)90012-0",{"id":26,"text":2394,"url":26,"identifiers":2395},"McGregor, R.: Statement of interest, in K. von Luck, B. Nebel, and C. Peltason (eds),Statement of Interest for the 2nd International Workshop on Terminological Logics, Document D-91-13, DFKI Kaiserslautern 1991.",{},{"id":26,"text":2397,"url":26,"identifiers":2398},"?BACK, System presentation, inTerminological Logic Users Workshop ? Proceedings, KIT-Report 95, TU Berlin, 1991, p. 186.",{},{"id":26,"text":2400,"url":26,"identifiers":2401},"Nebel, B. and Smolka, G.: Attribute description formalisms ... and the rest of the world, in C. Rollinger and O. Herzog (eds),Text Understanding in LILOG, LNAI 546. Springer-Verlag, Berlin, 1991.",{},{"id":26,"text":2403,"url":26,"identifiers":2404},"Peltason, C., Luck, K. von and Kindermann, C. (Org.):Terminological Logics Users Workshop ? Proceedings. KIT Report 95, TU Berlin, 1991.",{},{"id":26,"text":2406,"url":26,"identifiers":2407},"Poole, D. L.: Variables in hypothesis, inProc. 10th Internat. Joint Conf. on Artificial Intelligence, Milano, Italy, 1987.",{},{"id":26,"text":2409,"url":26,"identifiers":2410},"Post, E. L.: Recursive unsolvability of a problem of Thue,Journal of Symbolic Logic 12 (1947), 1?10.",{"doi":2411},"10.2307\u002F2267170",{"id":26,"text":2413,"url":26,"identifiers":2414},"Reiter, R.: A logic for default reasoning,Artificial Intelligence 13(1?2) (1980), 81?132.",{"doi":2415},"10.1016\u002F0004-3702(80)90014-4",{"id":26,"text":2417,"url":26,"identifiers":2418},"Reiter, R.: A theory of diagnosis from first principles,Artificial Intelligence 32 (1987), 57?95.",{"doi":2419},"10.1016\u002F0004-3702(87)90062-2",{"id":26,"text":2421,"url":26,"identifiers":2422},"Rymon, R.: Search through systematic set enumeration, inProc. 3rd Internat. Conf. on Knowledge Representation and Reasoning, Cambridge, MA, 1992.",{},{"id":26,"text":2424,"url":26,"identifiers":2425},"Schmidt-Schauß, M. and Smolka, G.: Attributive concept descriptions with complements,Artificial Intelligence 48 (1991), 1?46.",{"doi":2426},"10.1016\u002F0004-3702(91)90078-X",{"id":26,"text":2428,"url":26,"identifiers":2429},"Schwind, C. and Risch, V.: A tableau-based characterisation for default logic, inProc. 1st European Conf. on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, 1991, 310?317.",{"doi":2430},"10.1007\u002F3-540-54659-6_107",{"id":2432,"createTime":2433,"updateTime":2434,"relativeEntities":2435,"slug":2436,"properties":2437,"entityType":827,"verifyStatus":25,"verifyTime":2434,"verifyNote":828,"syncStatus":28,"languages":2448,"translateLanguages":26,"viewCount":36,"primaryUrl":2449,"fullTextUrl":26,"authors":2450,"publicationType":860,"publisherRelationship":2513,"citationCount":633,"citationInfo":2543,"publishDate":2545,"publishYear":2546,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":2547,"isForceReanalyzing":902},"02facd32-6411-44ef-963e-37d98acc0570","2024-04-15T09:59:26.878+00:00","2025-01-06T05:27:58.906+00:00",[],"An-approach-to-systems-verification",{"mag":2438,"keywords":2440,"openalex":2441,"abstract":2443,"title":2444,"doi":2446},{"VOID":2439},"2084715426",{},{"VOID":2442},"W2084715426",{},{"EN":2445},"An approach to systems verification",{"VOID":2447},"10.1007\u002Fbf00243131",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF00243131",[2451,2469,2483,2499],{"id":2452,"sortIndex":115,"researcher":26,"roles":2453,"affiliations":2454,"properties":2464},"3ea77844-090d-48cc-9774-c82bee4f46b2",[],[2455],{"id":26,"sortIndex":36,"affiliation":2456,"properties":26},{"id":2457,"createTime":2458,"updateTime":2458,"relativeEntities":2459,"slug":2460,"properties":2461,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"bbf035cf-ba65-4ba3-9fd4-77781d8bad90","2024-04-15T09:59:26.916+00:00",[],"Computational-Logic-Inc-1717-West-Sixth-Street-Suite-290-78703-Austin-TX-U-S-A-",{"title":2462},{"EN":2463},"Computational Logic, Inc., 1717 West Sixth Street, Suite 290, 78703, Austin, TX, U.S.A.",{"openalex":2465,"title":2467},{"VOID":2466},"A5084447019",{"EN":2468},"Warren A. Hunt",{"id":2470,"sortIndex":114,"researcher":26,"roles":2471,"affiliations":2472,"properties":2478},"2e50bc32-671c-4094-aea3-cbba26f43d37",[],[2473],{"id":26,"sortIndex":36,"affiliation":2474,"properties":26},{"id":2457,"createTime":2458,"updateTime":2458,"relativeEntities":2475,"slug":2460,"properties":2476,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2477},{"EN":2463},{"openalex":2479,"title":2481},{"VOID":2480},"A5046673609",{"EN":2482},"J. Strother Moore",{"id":2484,"sortIndex":59,"researcher":26,"roles":2485,"affiliations":2486,"properties":2492},"47a4571b-c123-4f20-aca0-848ec586fb2f",[],[2487],{"id":26,"sortIndex":36,"affiliation":2488,"properties":26},{"id":2457,"createTime":2458,"updateTime":2458,"relativeEntities":2489,"slug":2460,"properties":2490,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2491},{"EN":2463},{"openalex":2493,"orcid":2495,"title":2497},{"VOID":2494},"A5000371423",{"VOID":2496},"https:\u002F\u002Forcid.org\u002F0000-0002-4605-5803",{"EN":2498},"William D. Young",{"id":2500,"sortIndex":36,"researcher":26,"roles":2501,"affiliations":2502,"properties":2508},"db10d841-83b7-4626-b8b8-48ccaea588e2",[],[2503],{"id":26,"sortIndex":36,"affiliation":2504,"properties":26},{"id":2457,"createTime":2458,"updateTime":2458,"relativeEntities":2505,"slug":2460,"properties":2506,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2507},{"EN":2463},{"openalex":2509,"title":2511},{"VOID":2510},"A5076845184",{"EN":2512},"William R. Bevier",{"url":26,"publisher":2514,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2515,"slug":663,"properties":2516,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2521,"manageAffiliations":2522,"indexDatabases":2523,"url":26,"thumbnailPath":26,"statistic":2538,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2517,"eissn":2518,"title":2519,"url":2520},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[2524,2531],{"id":721,"indexDatabase":2525,"url":734,"indexYears":735,"academicFieldIds":2530,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":2526,"label":2527,"description":2528,"key":731,"publicationTags":2529,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":2532,"url":757,"indexYears":26,"academicFieldIds":2537,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":2533,"label":2534,"description":2535,"key":753,"publicationTags":2536,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":2539,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":2540,"totalCitation":768,"totalCitationByYear":2541,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":2542,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},{"total":633,"publishYear":26,"statisticByYear":2544},{"2012":114,"2013":111,"2014":114,"2016":114,"2017":115,"2019":115,"2020":114,"2021":114,"2022":114,"2023":115},"1989-12-01",1989,[2548,2551,2554,2557,2561,2564,2567,2571,2574,2578,2582,2585,2588,2592,2595,2598],{"id":26,"text":2549,"url":26,"identifiers":2550},"Bevier, W. R., ‘Kit and the short stack’ (in this issue of The Journal of Automated Reasoning).",{},{"id":26,"text":2552,"url":26,"identifiers":2553},"Bevier, W. R., ‘Kit: A study in operating system verification’ (to appear in IEEE Trans. on Soft. Eng.). Also available as Tech. Rept 28, Computational Logic, Inc., 1717 West Sixth Street, Suite 290, Austin, Texas, 78703.",{},{"id":26,"text":2555,"url":26,"identifiers":2556},"Boyer, R. S. and Moore, J S., ‘Metafunctions: Proving them correct and using them efficiently as new proof procedures’, In The Correctness Problem in Computer Science (eds R. S. Boyer and J S. Moore), Academic Press, London, 1981.",{},{"id":26,"text":2558,"url":26,"identifiers":2559},"Boyer, R. S. and Moore, J S., ‘A fast string searching algorithm’, Comm. ACM\n20, 10 (1977), 762–772.",{"doi":2560},"10.1145\u002F359842.359859",{"id":26,"text":2562,"url":26,"identifiers":2563},"Boyer, R. S. and Moore, J S., ‘A verification condition generator for FORTRAN’, In The Correctness Problem in Computer Science (eds R. S. Boyer and J S. Moore), Academic Press, London, 1981.",{},{"id":26,"text":2565,"url":26,"identifiers":2566},"Boyer, R. S. and Moore, J S., ‘MJRTY — a fast majority vote algorithm’, Tech. Rept ICSCA-CMP-32, Institute for Computing Science and Computer Applications, Univ. of Texas at Austin, 1982. Also available through Computational Logic, Inc., Suite 290, 1717 West Sixth Street, Austin, TX 78703.",{},{"id":26,"text":2568,"url":26,"identifiers":2569},"Boyer, R. S. and Moore, J S., ‘Proof checking the RSA public key encryption algorithm’, Amer. Math. Monthly\n91, 3 (1984), 181–189.",{"doi":2570},"10.1080\u002F00029890.1984.11971371",{"id":26,"text":2572,"url":26,"identifiers":2573},"Boyer, R. S. and Moore, J. S., A Computational Logic Handbook, Academic Press, Boston, 1988.",{},{"id":26,"text":2575,"url":26,"identifiers":2576},"Good, D. I., Cohen, R. M., and Keeton-Williams, J., ‘Principles of proving concurrent programs in Gypsy’, Tech. Rept ICSCA-CMP-15, Institute for Computer Science and Computing Applications, Univ. of Texas at Austin, January, 1979.",{"doi":2577},"10.1145\u002F567752.567757",{"id":26,"text":2579,"url":26,"identifiers":2580},"Gordon, M. J., Milner, A. J., and Wadsworth, C. P., Edinburgh LCF, Springer-Verlag, New York, 1979.",{"doi":2581},"10.1007\u002F3-540-09724-4",{"id":26,"text":2583,"url":26,"identifiers":2584},"Hunt, W. A., ‘Microprocessor design verification’ (in this issue of The Journal of Automated Reasoning).",{},{"id":26,"text":2586,"url":26,"identifiers":2587},"Kaufmann, Matt, A user's manual for an interactive enhancement to the Boyer-Moore theorem prover’, Tech. Rept CLI-19, CLInc, May, 1988.",{},{"id":26,"text":2589,"url":26,"identifiers":2590},"Lengauer, C. and Huang, C.-H., ‘A mechanically certified theorem about optimal concurrency of sorting networks’, Proc. 13th Ann. ACM Symp. on Principles of Programming Languages, 1986, pp. 307–317.",{"doi":2591},"10.1145\u002F512644.512673",{"id":26,"text":2593,"url":26,"identifiers":2594},"Moore, J S., A mechanically verified language implementation’ (in this issue of The Journal of Automated Reasoning). Also available as Tech. Rept 30, Computational Logic, Inc., 1717 West Sixth Street, Suite 290, Austin, Texas, 78703.",{},{"id":26,"text":2596,"url":26,"identifiers":2597},"Shankar, N., ‘Proof checking metamathematics’, Univ. of Texas at Austin, 1986. Also available through Computational Logic, Inc., Suite 290, 1717 West Sixth Street, Austin, TX 78703.",{},{"id":26,"text":2599,"url":26,"identifiers":2600},"Young, W. D., ‘A mechanically verified code generator’ (in this issue of The Journal of Automated Reasoning). Also available as Tech Rept 36, Computational Logic, Inc., 1717 West Sixth Street, Suite 290, Austin, Texas, 78703.",{},{"id":2602,"createTime":2603,"updateTime":2604,"relativeEntities":2605,"slug":2606,"properties":2607,"entityType":827,"verifyStatus":25,"verifyTime":2604,"verifyNote":828,"syncStatus":28,"languages":2618,"translateLanguages":26,"viewCount":36,"primaryUrl":2619,"fullTextUrl":26,"authors":2620,"publicationType":860,"publisherRelationship":2675,"citationCount":2705,"citationInfo":2706,"publishDate":2708,"publishYear":2709,"citationAnalyzeStatus":975,"lastCitationAnalyze":2710,"indexDatabases":26,"openAccess":26,"references":2711,"isForceReanalyzing":902},"47518467-cda4-4d4b-b467-888a34e2a588","2024-04-11T16:40:45.087+00:00","2025-02-25T11:00:14.377+00:00",[],"Extending-Sledgehammer-with-SMT-Solvers",{"mag":2608,"keywords":2610,"openalex":2611,"abstract":2613,"title":2614,"doi":2616},{"VOID":2609},"2022589543",{},{"VOID":2612},"W2022589543",{},{"EN":2615},"Extending Sledgehammer with SMT Solvers",{"VOID":2617},"10.1007\u002Fs10817-013-9278-5",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002Fs10817-013-9278-5",[2621,2642,2661],{"id":2622,"sortIndex":114,"researcher":26,"roles":2623,"affiliations":2624,"properties":2635},"4ddaedf5-aa11-4584-8bd0-b483677172d6",[],[2625],{"id":26,"sortIndex":36,"affiliation":2626,"properties":26},{"id":2627,"createTime":2628,"updateTime":2629,"relativeEntities":2630,"slug":2631,"properties":2632,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"2b01e1e7-7f3d-43be-8262-7c203cedac9f","2024-01-04T22:57:05.739+00:00","2024-09-28T14:30:11.747+00:00",[],"Computer-Laboratory-University-of-Cambridge-Cambridge-UK",{"title":2633},{"VI":2634},"Computer Laboratory, University of Cambridge, Cambridge, UK",{"openalex":2636,"orcid":2638,"title":2640},{"VOID":2637},"A5086565312",{"VOID":2639},"https:\u002F\u002Forcid.org\u002F0000-0003-0288-4279",{"EN":2641},"Lawrence C. Paulson",{"id":2643,"sortIndex":36,"researcher":26,"roles":2644,"affiliations":2645,"properties":2654},"89b7191d-abfa-45da-8769-16f40f442560",[],[2646],{"id":26,"sortIndex":36,"affiliation":2647,"properties":26},{"id":2648,"createTime":2649,"updateTime":2649,"relativeEntities":2650,"slug":26,"properties":2651,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},"b4ba48e9-4f7f-4f19-87df-83df75f526e8","2024-01-18T18:08:27.519+00:00",[],{"title":2652},{"VI":2653},"Institut für Informatik, Technische Universität München, Munich, Germany",{"openalex":2655,"orcid":2657,"title":2659},{"VOID":2656},"A5079200257",{"VOID":2658},"https:\u002F\u002Forcid.org\u002F0000-0002-8367-0936",{"EN":2660},"Jasmin Christian Blanchette",{"id":2662,"sortIndex":115,"researcher":26,"roles":2663,"affiliations":2664,"properties":2670},"9764a4f7-5288-46b8-9ace-0debb070cddd",[],[2665],{"id":26,"sortIndex":36,"affiliation":2666,"properties":26},{"id":2648,"createTime":2649,"updateTime":2649,"relativeEntities":2667,"slug":26,"properties":2668,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2669},{"VI":2653},{"openalex":2671,"title":2673},{"VOID":2672},"A5003240726",{"EN":2674},"Sascha Böhme",{"url":26,"publisher":2676,"properties":26},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2677,"slug":663,"properties":2678,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2683,"manageAffiliations":2684,"indexDatabases":2685,"url":26,"thumbnailPath":26,"statistic":2700,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2679,"eissn":2680,"title":2681,"url":2682},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[2686,2693],{"id":721,"indexDatabase":2687,"url":734,"indexYears":735,"academicFieldIds":2692,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":2688,"label":2689,"description":2690,"key":731,"publicationTags":2691,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":2694,"url":757,"indexYears":26,"academicFieldIds":2699,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":2695,"label":2696,"description":2697,"key":753,"publicationTags":2698,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":2701,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":2702,"totalCitation":768,"totalCitationByYear":2703,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":2704,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},120,{"total":2705,"publishYear":26,"statisticByYear":2707},{"2012":115,"2013":162,"2014":116,"2015":298,"2016":103,"2017":162,"2018":124,"2019":51,"2020":116,"2021":51,"2022":135,"2023":50,"2024":59},"2013-06-01",2013,"2024-04-11T19:27:12.471+00:00",[2712,2716,2720,2724,2727,2731,2735,2739,2742,2746,2749,2753,2757,2761,2764,2768,2772,2776,2780,2783,2787,2791,2795,2799,2802,2805,2809,2813,2816,2820,2824,2828,2832,2835,2838,2842,2846,2850,2854,2858,2862,2866,2869,2873,2876,2879,2883,2886,2890,2893,2897,2900,2903,2906,2909,2913,2917,2921,2924,2928,2932,2936],{"id":26,"text":2713,"url":26,"identifiers":2714},"Ahrendt, W., Beckert, B., Hähnle, R., Menzel, W., Reif, W., Schellhorn, G., Schmitt, P.H.: Integrating automated and interactive theorem proving. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction—A Basis for Applications, Systems and Implementation Techniques, vol. II, pp. 97–116. Kluwer (1998)",{"doi":2715},"10.1007\u002F978-94-017-0435-9_4",{"id":26,"text":2717,"url":26,"identifiers":2718},"Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Applied Logic, vol. 27. Springer (2002)",{"doi":2719},"10.1007\u002F978-94-015-9934-4",{"id":26,"text":2721,"url":26,"identifiers":2722},"Armand, M., Faure, G., Grégoire, B., Keller, C., Théry, L., Werner, B.: A modular integration of SAT\u002FSMT solvers to Coq through proof witnesses. In: Jouannaud, J.P., Shao, Z. (eds.) Certified Programs and Proofs (CPP 2011), LNCS, vol. 7086, pp. 135–150. Springer (2011)",{"doi":2723},"10.1007\u002F978-3-642-25379-9_12",{"id":26,"text":2725,"url":26,"identifiers":2726},"Barrett, C., Stump, A., Tinelli, C.: The SMT-LIB standard—Version 2.0. In: Gupta, A., Kroening, D. (eds.) Satisfiability Modulo Theories (SMT) (2010)",{},{"id":26,"text":2728,"url":26,"identifiers":2729},"Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) Computer Aided Verification (CAV 2007), LNCS, vol. 4590, pp. 298–302. Springer (2007)",{"doi":2730},"10.1007\u002F978-3-540-73368-3_34",{"id":26,"text":2732,"url":26,"identifiers":2733},"Barsotti, D., Nieto, L.P., Tiu, A.: Verification of clock synchronization algorithms: experiments on a combination of deductive tools. Form. Asp. Comput. 19(3), 321–341 (2007)",{"doi":2734},"10.1007\u002Fs00165-007-0027-6",{"id":26,"text":2736,"url":26,"identifiers":2737},"Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. J. Funct. Program. 13(2), 261–293 (2003)",{"doi":2738},"10.1017\u002FS0956796802004501",{"id":26,"text":2740,"url":26,"identifiers":2741},"Besson, F., Fontaine, P., Théry, L.: A flexible proof format for SMT: a proposal. In: Fontaine, P., Stump, A. (eds.) Proof Exchange for Theorem Proving (PxTP-2011), pp. 15–26 (2011)",{},{"id":26,"text":2743,"url":26,"identifiers":2744},"Bezem, M., Hendriks, D., de Nivelle, H.: Automatic proof construction in type using resolution. J. Autom. Reasoning 29(3–4), 253–275 (2002)",{"doi":2745},"10.1023\u002FA:1021939521172",{"id":26,"text":2747,"url":26,"identifiers":2748},"Blanchette, J.C.: Automatic Proofs and Refutations for Higher-Order Logic. Ph.D. thesis, Dept. of Informatics, T.U. München (2012)",{},{"id":26,"text":2750,"url":26,"identifiers":2751},"Blanchette, J.C., Böhme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) Conference on Automated Deduction (CADE-23), LNAI, vol. 6803, pp. 207–221. Springer (2011)",{"doi":2752},"10.1007\u002F978-3-642-22438-6_11",{"id":26,"text":2754,"url":26,"identifiers":2755},"Blanchette, J.C., Böhme, S., Popescu, A., Smallbone, N.: Encoding monomorphic and polymorphic types. In: Piterman, N., Smolka, S. (eds.) Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), LNCS, vol. 7795. Springer (2013)",{"doi":2756},"10.1007\u002F978-3-642-36742-7_34",{"id":26,"text":2758,"url":26,"identifiers":2759},"Blanchette, J.C., Popescu, A., Wand, D., Weidenbach, C.: More SPASS with Isabelle—Superposition with hard sorts and configurable simplification. In: Beringer, L., Felty, A. (eds.) Interactive Theorem Proving (ITP 2012), no. 7406 in LNCS, pp. 345–360. Springer (2012)",{"doi":2760},"10.1007\u002F978-3-642-32347-8_24",{"id":26,"text":2762,"url":26,"identifiers":2763},"Böhme, S.: Proving Theorems of Higher-Order Logic with SMT Solvers. Ph.D. thesis, Dept. of Informatics, T.U. München (2012)",{},{"id":26,"text":2765,"url":26,"identifiers":2766},"Böhme, S., Fox, A.C.J., Sewell, T., Weber, T.: Reconstruction of Z3’s bit-vector proofs in HOL4 and Isabelle\u002FHOL. In: Jouannaud, J.P., Shao, Z. (eds.) Certified Programs and Proofs (CPP 2011), LNCS, vol. 7086, pp. 183–198. Springer (2011)",{"doi":2767},"10.1007\u002F978-3-642-25379-9_15",{"id":26,"text":2769,"url":26,"identifiers":2770},"Böhme, S., Moskal, M., Schulte, W., Wolff, B.: HOL-Boogie—an interactive prover-backend for the verifying C compiler. J. Autom. Reasoning 44(1–2), 111–144 (2010)",{"doi":2771},"10.1007\u002Fs10817-009-9142-9",{"id":26,"text":2773,"url":26,"identifiers":2774},"Böhme, S., Nipkow, T.: Sledgehammer: judgement day. In: Giesl, J., Hähnle, R. (eds.) International Joint Conference on Automated Reasoning (IJCAR 2010), LNAI, vol. 6173, pp. 107–121. Springer (2010)",{"doi":2775},"10.1007\u002F978-3-642-14203-1_9",{"id":26,"text":2777,"url":26,"identifiers":2778},"Böhme, S., Weber, T.: Fast LCF-style proof reconstruction for Z3. In: Kaufmann, M., Paulson, L. (eds.) Interactive Theorem Proving (ITP 2010), LNCS, vol. 6172, pp. 179–194. Springer (2010)",{"doi":2779},"10.1007\u002F978-3-642-14052-5_14",{"id":26,"text":2781,"url":26,"identifiers":2782},"Böhme, S., Weber, T.: Designing proof formats: a user’s perspective. In: Fontaine, P., Stump, A. (eds.) Proof Exchange for Theorem Proving (PxTP-2011), pp. 27–32 (2011)",{},{"id":26,"text":2784,"url":26,"identifiers":2785},"Bouillaguet, C., Kuncak, V., Wies, T., Zee, K., Rinard, M.C.: Using first-order theorem provers in the Jahob data structure verification system. In: Cook, B., Podelski, A. (eds.) Verification, Model Checking, and Abstract Interpretation (VMCAI 2007), LNCS, vol. 4349, pp. 74–88. Springer (2007)",{"doi":2786},"10.1007\u002F978-3-540-69738-1_5",{"id":26,"text":2788,"url":26,"identifiers":2789},"Bradley, A.R., Manna, Z.: Property-directed incremental invariant generation. Form. Asp. Comput. 20, 379–405 (2008)",{"doi":2790},"10.1007\u002Fs00165-008-0080-9",{"id":26,"text":2792,"url":26,"identifiers":2793},"Cohen, E., Dahlweid, M., Hillebrand, M.A., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., Tobies, S.: VCC: a practical system for verifying concurrent C. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) Theorem Proving in Higher Order Logics (TPHOLs 2009), LNCS, vol. 5674, pp. 23–42. Springer (2009)",{"doi":2794},"10.1007\u002F978-3-642-03359-9_2",{"id":26,"text":2796,"url":26,"identifiers":2797},"Dahn, B., Gehne, J., Honigmann, T., Wolf, A.: Integration of automated and interactive theorem proving in ILF. In: McCune, W. (ed.) Conference on Automated Deduction (CADE-14), LNCS, vol. 1249, pp. 57–60. Springer (1997)",{"doi":2798},"10.1007\u002F3-540-63104-6_7",{"id":26,"text":2800,"url":26,"identifiers":2801},"Dutertre, B., de Moura, L.: The Yices SMT solver. Available http:\u002F\u002Fyices.csl.sri.com\u002Ftool-paper.pdf (2006). Accessed 21 Feb 2013",{},{"id":26,"text":2803,"url":26,"identifiers":2804},"Erkök, L., Matthews, J.: Using Yices as an automated solver in Isabelle\u002FHOL. In: Rushby, J., Shankar, N. (eds.) Automated Formal Methods (AFM08), pp. 3–13 (2008)",{},{"id":26,"text":2806,"url":26,"identifiers":2807},"Fontaine, P., Marion, J.Y., Merz, S., Nieto, L.P., Tiu, A.: Expressiveness + automation + soundness: towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2006), LNCS, vol. 3920, pp. 167–181. Springer (2006)",{"doi":2808},"10.1007\u002F11691372_11",{"id":26,"text":2810,"url":26,"identifiers":2811},"Foster, S., Struth, G.: Integrating an automated theorem prover into Agda. In: Bobaru, M.G., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NASA Formal Methods (NFM 2011), LNCS, vol. 6617, pp. 116–130 (2011)",{"doi":2812},"10.1007\u002F978-3-642-20398-5_10",{"id":26,"text":2814,"url":26,"identifiers":2815},"Gordon, M.J.C., Milner, R., Wadsworth, C.P.: Edinburgh LCF: A Mechanised Logic of Computation, LNCS, vol. 78. Springer (1979)",{"doi":2581},{"id":26,"text":2817,"url":26,"identifiers":2818},"Guttmann, W., Struth, G., Weber, T.: Automating algebraic methods in Isabelle. In: Qin, S., Qiu, Z. (eds.) International Conference on Formal Engineering Methods (ICFEM 2011), LNCS, vol. 6991, pp. 617–632. Springer (2011)",{"doi":2819},"10.1007\u002F978-3-642-24559-6_41",{"id":26,"text":2821,"url":26,"identifiers":2822},"Hoder, K., Voronkov, A.: Sine qua non for large theory reasoning. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) Conference on Automated Deduction (CADE-23), LNAI, vol. 6803, pp. 299–314. Springer (2011)",{"doi":2823},"10.1007\u002F978-3-642-22438-6_23",{"id":26,"text":2825,"url":26,"identifiers":2826},"Hughes, R.J.M.: Super-combinators: A new implementation method for applicative languages. In: LISP and Functional Programming (LFP 1982), pp. 1–10. ACM Press (1982)",{"doi":2827},"10.1145\u002F800068.802129",{"id":26,"text":2829,"url":26,"identifiers":2830},"Hurd, J.: Integrating Gandalf and HOL. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) Theorem Proving in Higher Order Logics (TPHOLs ’99), LNCS, vol. 1690, pp. 311–321 (1999)",{"doi":2831},"10.1007\u002F3-540-48256-3_21",{"id":26,"text":2833,"url":26,"identifiers":2834},"Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Archer, M., Di Vito, B., Muñoz, C. (eds.) Design and Application of Strategies\u002FTactics in Higher Order Logics, no. CP-2003-212448 in NASA Technical Reports, pp. 56–68 (2003)",{},{"id":26,"text":2836,"url":26,"identifiers":2837},"Klein, G., Nipkow, T., Paulson, L. (eds.): The Archive of Formal Proofs. http:\u002F\u002Fafp.sf.net\u002F . Accessed 21 Feb 2013",{},{"id":26,"text":2839,"url":26,"identifiers":2840},"McCune, W., Shumsky, O.: System description: IVY. In: McAllester, D. (ed.) Conference on Automated Deduction (CADE-17), LNAI, vol. 1831, pp. 401–405. Springer (2000)",{"doi":2841},"10.1007\u002F10721959_30",{"id":26,"text":2843,"url":26,"identifiers":2844},"McLaughlin, S., Barrett, C., Ge, Y.: Cooperating theorem provers: a case study combining HOL-Light and CVC Lite. Electr. Notes Theor. Comput. Sci. 144(2), 43–51 (2006)",{"doi":2845},"10.1016\u002Fj.entcs.2005.12.005",{"id":26,"text":2847,"url":26,"identifiers":2848},"Meier, A.: Tramp: Transformation of machine-found proofs into natural deduction proofs at the assertion level (system description). In: McAllester, D. (ed.) Conference on Automated Deduction (CADE-17), LNAI, vol. 1831, pp. 460–464. Springer (2000)",{"doi":2849},"10.1007\u002F10721959_37",{"id":26,"text":2851,"url":26,"identifiers":2852},"Meng, J., Paulson, L.C.: Translating higher-order clauses to first-order clauses. J. Autom. Reasoning 40(1), 35–60 (2008)",{"doi":2853},"10.1007\u002Fs10817-007-9085-y",{"id":26,"text":2855,"url":26,"identifiers":2856},"Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. Journal of Applied Logic 7(1), 41–57 (2009)",{"doi":2857},"10.1016\u002Fj.jal.2007.07.004",{"id":26,"text":2859,"url":26,"identifiers":2860},"Moskal, M.: Programming with triggers. In: Dutertre, B., Strichman, O. (eds.) Satisfiability Modulo Theories (SMT 2009) (2009)",{"doi":2861},"10.1145\u002F1670412.1670416",{"id":26,"text":2863,"url":26,"identifiers":2864},"de Moura, L.M., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2008), LNCS, vol. 4963, pp. 337–340. Springer (2008)",{"doi":2865},"10.1007\u002F978-3-540-78800-3_24",{"id":26,"text":2867,"url":26,"identifiers":2868},"Nipkow, T.: Re: [isabelle] A beginner’s questionu [sic]. Archived https:\u002F\u002Flists.cam.ac.uk\u002Fpipermail\u002Fcl-isabelle-users\u002F2010-November\u002Fmsg00097.html (2010). Accessed 21 Feb 2013",{},{"id":26,"text":2870,"url":26,"identifiers":2871},"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\u002FHOL: A Proof Assistant for Higher-Order Logic, LNCS, vol. 2283. Springer (2002)",{"doi":2872},"10.1007\u002F3-540-45949-9",{"id":26,"text":2874,"url":26,"identifiers":2875},"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 335–367. Elsevier (2001)",{"doi":2200},{"id":26,"text":2877,"url":26,"identifiers":2878},"Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Ternovska, E., Schulz, S., (eds.) International Workshop on the Implementation of Logics (IWIL-2010) (2010)",{},{"id":26,"text":2880,"url":26,"identifiers":2881},"Paulson, L.C., Susanto, K.W.: Source-level proof reconstruction for interactive theorem proving. In: Schneider, K., Brandt, J. (eds.) Theorem Proving in Higher Order Logics (TPHOLs 2007), LNCS, vol. 4732, pp. 232–245 (2007)",{"doi":2882},"10.1007\u002F978-3-540-74591-4_18",{"id":26,"text":2884,"url":26,"identifiers":2885},"Ranise, S., Tinelli, C.: The SMT-LIB standard: Version 1.2. http:\u002F\u002Fsmtlib.cs.uiowa.edu\u002Fpapers\u002Fformat-v1.2-r06.08.30.pdf (2006). Accessed 21 Feb 2013",{},{"id":26,"text":2887,"url":26,"identifiers":2888},"Reif, W., Schellhorn, G.: Theorem proving in large theories. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction—A Basis for Applications, vol. III: Applications, pp. 225–241. Kluwer (1998)",{"doi":2889},"10.1007\u002F978-94-017-0437-3_9",{"id":26,"text":2891,"url":26,"identifiers":2892},"Riazanov, A., Voronkov, A.: The design and implementation of Vampire. AI Commun. 15(2–3), 91–110 (2002)",{},{"id":26,"text":2894,"url":26,"identifiers":2895},"Rinard, M.C.: Integrated reasoning and proof choice point selection in the Jahob system—mechanisms for program survival. In: Schmidt, R.A. (ed.) Conference on Automated Deduction (CADE-22), LNCS, vol. 5663, pp. 1–16. Springer (2009)",{"doi":2896},"10.1007\u002F978-3-642-02959-2_1",{"id":26,"text":2898,"url":26,"identifiers":2899},"Rudnicki, P., Urban, J.: Escape to ATP for Mizar. In: Fontaine, P., Stump, A. (eds.) Proof Exchange for Theorem Proving (PxTP-2011) (2011)",{},{"id":26,"text":2901,"url":26,"identifiers":2902},"Rushby, J.M.: Tutorial: automated formal methods with PVS, SAL, and Yices. In: Hung, D.V., Pandya, P. (eds.) Software Engineering and Formal Methods (SEFM 2006), p. 262. IEEE (2006)",{},{"id":26,"text":2904,"url":26,"identifiers":2905},"Schropp, A.: Instantiating Deeply Embedded Many-sorted Theories into HOL Types in Isabelle. M.Sc. thesis, Dept. of Informatics, T.U. München (2012)",{},{"id":26,"text":2907,"url":26,"identifiers":2908},"Schulz, S.: System description: E 0.81. In: Basin, D., Rusinowitch, M. (eds.) International Joint Conference on Automated Reasoning (IJCAR 2004), LNAI, vol. 3097, pp. 223–228. Springer (2004)",{},{"id":26,"text":2910,"url":26,"identifiers":2911},"Siekmann, J., Benzmüller, C., Fiedler, A., Meier, A., Normann, I., Pollet, M.: Proof development with Ω mega: the irrationality of $\\sqrt2$ . In: Kamareddine, F. (ed.) Thirty Five Years of Automating Mathematics, Applied Logic, vol. 28, pp. 271–314. Springer (2003)",{"doi":2912},"10.1007\u002F978-94-017-0253-9_11",{"id":26,"text":2914,"url":26,"identifiers":2915},"Sutcliffe, G.: System description: SystemOnTPTP. In: McAllester, D. (ed.) Conference on Automated Deduction (CADE-17), LNAI, vol. 1831, pp. 406–410. Springer (2000)",{"doi":2916},"10.1007\u002F10721959_31",{"id":26,"text":2918,"url":26,"identifiers":2919},"Sutcliffe, G.: The TPTP problem library and associated infrastructure—the FOF and CNF parts, v3.5.0. J. Autom. Reasoning 43(4), 337–362 (2009)",{"doi":2920},"10.1007\u002Fs10817-009-9143-8",{"id":26,"text":2922,"url":26,"identifiers":2923},"Wampler-Doty, M.: A complete proof of the Robbins conjecture. In: G. Klein, T. Nipkow, L. Paulson (eds.) The Archive of Formal Proofs. Available http:\u002F\u002Fafp.sf.net\u002Fentries\u002FRobbins-Conjecture.shtml (2010). Accessed 21 Feb 2013",{},{"id":26,"text":2925,"url":26,"identifiers":2926},"Weber, T.: SMT solvers: new oracles for the HOL theorem prover. J. Softw. Tools Technol. Transfer 13(5), 419–429 (2011)",{"doi":2927},"10.1007\u002Fs10009-011-0188-8",{"id":26,"text":2929,"url":26,"identifiers":2930},"Weidenbach, C.: Combining superposition, sorts and splitting. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 1965–2013. Elsevier (2001)",{"doi":2931},"10.1016\u002FB978-044450813-3\u002F50029-1",{"id":26,"text":2933,"url":26,"identifiers":2934},"Wenzel, M.: Type classes and overloading in higher-order logic. In: Gunter, E.L., Felty, A. (eds.) Theorem Proving in Higher Order Logics (TPHOLs ’97), LNCS, vol. 1275, pp. 307–322 (1997)",{"doi":2935},"10.1007\u002FBFb0028402",{"id":26,"text":2937,"url":26,"identifiers":2938},"Wenzel, M.: Parallel proof checking in Isabelle\u002FIsar. In: Dos Reis, G., Théry, L. (eds.) Programming Languages for Mechanized Mathematics Systems (PLMMS 2009). ACM Digital Library (2009)",{},{"id":2940,"createTime":2941,"updateTime":2942,"relativeEntities":2943,"slug":2944,"properties":2945,"entityType":827,"verifyStatus":25,"verifyTime":2942,"verifyNote":828,"syncStatus":28,"languages":2956,"translateLanguages":26,"viewCount":36,"primaryUrl":2957,"fullTextUrl":26,"authors":2958,"publicationType":860,"publisherRelationship":2986,"citationCount":3022,"citationInfo":3023,"publishDate":2323,"publishYear":2324,"citationAnalyzeStatus":28,"lastCitationAnalyze":26,"indexDatabases":26,"openAccess":26,"references":3025,"isForceReanalyzing":902},"ac69de8b-6953-4ba7-9b4f-58f27fbe7d26","2024-04-18T03:26:33.211+00:00","2025-01-14T13:23:30.490+00:00",[],"Priorities-on-defaults-with-prerequisites-and-their-application-in-treating-specificity-in-terminological-default-logic",{"mag":2946,"keywords":2948,"openalex":2949,"abstract":2951,"title":2952,"doi":2954},{"VOID":2947},"2147860979",{},{"VOID":2950},"W2147860979",{},{"EN":2953},"Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic",{"VOID":2955},"10.1007\u002Fbf00881830",[102],"http:\u002F\u002Flink.springer.com\u002F10.1007\u002FBF00881830",[2959,2973],{"id":2960,"sortIndex":36,"researcher":26,"roles":2961,"affiliations":2962,"properties":2969},"36c55e69-e5c3-41b7-a1c8-402a0cbee80a",[],[2963],{"id":2964,"sortIndex":36,"affiliation":2965,"properties":26},"701ef04d-eab4-4504-8d1b-5679a5f30e51",{"id":2271,"createTime":2272,"updateTime":2272,"relativeEntities":2966,"slug":2274,"properties":2967,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2968},{"EN":2277},{"openalex":2970,"orcid":2971,"title":2972},{"VOID":2280},{"VOID":2282},{"EN":2284},{"id":2974,"sortIndex":115,"researcher":26,"roles":2975,"affiliations":2976,"properties":2983},"92ca799d-8579-4be4-98ce-9603c018d18b",[],[2977],{"id":2978,"sortIndex":36,"affiliation":2979,"properties":26},"052f39cf-638f-45cb-81b3-ff8c105b4b66",{"id":2251,"createTime":2252,"updateTime":2253,"relativeEntities":2980,"slug":2255,"properties":2981,"entityType":98,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36},[],{"title":2982},{"EN":2258},{"openalex":2984,"title":2985},{"VOID":2261},{"EN":2263},{"url":26,"publisher":2987,"properties":3016},{"id":659,"createTime":660,"updateTime":661,"relativeEntities":2988,"slug":663,"properties":2989,"entityType":24,"verifyStatus":28,"verifyTime":26,"verifyNote":26,"syncStatus":28,"languages":26,"translateLanguages":26,"viewCount":36,"subjectFields":2994,"manageAffiliations":2995,"indexDatabases":2996,"url":26,"thumbnailPath":26,"statistic":3011,"gsStatistic":26,"type":175,"analyzePriority":26},[],{"issn":2990,"eissn":2991,"title":2992,"url":2993},{"VOID":666},{"VOID":668},{"EN":670},{"VOID":672},[],[],[2997,3004],{"id":721,"indexDatabase":2998,"url":734,"indexYears":735,"academicFieldIds":3003,"indexDatabaseRanking":740},{"id":723,"createTime":724,"updateTime":725,"relativeEntities":2999,"label":3000,"description":3001,"key":731,"publicationTags":3002,"standard":26},[],{"EN":728,"VI":728},{"EN":728,"VI":730},[733],[737,738,739],{"id":742,"indexDatabase":3005,"url":757,"indexYears":26,"academicFieldIds":3010,"indexDatabaseRanking":26},{"id":744,"createTime":745,"updateTime":746,"relativeEntities":3006,"label":3007,"description":3008,"key":753,"publicationTags":3009,"standard":26},[],{"EN":749,"VI":749},{"VI":751,"EN":752},[755,756],[759],{"impactFactor":36,"impactFactorByYear":3012,"i10Index":349,"i10IndexLast5Year":52,"totalPublication":766,"totalPublicationByYear":3013,"totalCitation":768,"totalCitationByYear":3014,"totalCitationPerPublication":780,"totalCitationPerPublicationByYear":3015,"hindexLast5Year":396,"hindex":396},{"2012":154,"2013":115,"2014":762,"2015":763,"2016":513,"2017":132,"2018":523,"2019":342,"2020":646,"2021":275,"2022":764,"2023":765},{"1985":336,"1986":51,"1987":173,"1988":516,"1989":234,"1990":237,"1991":240,"1992":396,"1993":244,"1994":287,"1995":239,"1996":124,"1997":287,"1998":240,"1999":239,"2000":242,"2001":242,"2002":244,"2003":237,"2004":356,"2005":53,"2006":255,"2007":240,"2008":124,"2009":125,"2010":244,"2011":242,"2012":234,"2013":298,"2014":336,"2015":237,"2016":240,"2017":244,"2018":125,"2019":241,"2020":517,"2021":242,"2022":516,"2023":240,"2024":59},{"1985":399,"1986":770,"1987":633,"1988":516,"1989":771,"1990":772,"1991":539,"1992":135,"1993":362,"1994":773,"1995":774,"1996":127,"2003":117,"2004":775,"2005":776,"2006":401,"2007":777,"2009":249,"2010":535,"2011":778,"2012":534,"2013":779,"2014":162,"2015":254,"2016":204,"2017":241,"2018":124,"2019":361,"2020":357,"2021":242,"2022":135,"2023":162},{"1985":782,"1986":783,"1987":784,"1988":115,"1989":785,"1990":786,"1991":787,"1992":291,"1993":788,"1994":789,"1995":790,"1996":791,"2003":792,"2004":793,"2005":794,"2006":795,"2007":796,"2009":797,"2010":798,"2011":799,"2012":265,"2013":800,"2014":232,"2015":801,"2016":802,"2017":408,"2018":641,"2019":803,"2020":804,"2021":115,"2022":805,"2023":342},{"volume":3017,"pages":3019,"issue":3021},{"VOID":3018},"15",{"VOID":3020},"41-68",{"VOID":893},116,{"total":3022,"publishYear":26,"statisticByYear":3024},{"2012":114,"2013":135,"2014":158,"2015":116,"2016":162,"2017":162,"2018":158,"2019":135,"2020":111,"2021":114,"2022":115,"2023":114},[3026,3029,3032,3036,3039,3042,3046,3049,3052,3055,3059,3062,3065,3068,3071,3074,3077,3080,3083,3085],{"id":26,"text":3027,"url":26,"identifiers":3028},"Baader, F. and Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms, inProc. 3rd Int. Conf. on Knowledge Representation and Reasoning, Cambridge, MA, 1992.",{},{"id":26,"text":3030,"url":26,"identifiers":3031},"Baader, F. and Hollunder, B.: How to prefer more specific defaults in terminological default logic, inProc. 13th Int. Joint Conf. on Artificial Intelligence, Chambery, France, 1993.",{},{"id":26,"text":3033,"url":26,"identifiers":3034},"Besnard, P.:An Introduction to Default Logic, Symbolic Computation Series, Springer, 1989.",{"doi":3035},"10.1007\u002F978-3-662-05689-9",{"id":26,"text":3037,"url":26,"identifiers":3038},"Brachman, R. J., McGuinness, D. L., Patel-Schneider, P. F., Resnick, L. A., and Borgida, A.: Living with CLASSIC: When and how to use a KL-ONE-like languages, in J. Sowa (ed.),Principles of Semantic Networks, Morgan Kaufmann, San Mateo, CA, 1991, pp. 401?456.",{"doi":1169},{"id":26,"text":3040,"url":26,"identifiers":3041},"Brass, S.: Deduction with Supernormal Defaults, in G. Brewka, K. P. Jantke and P. H. Schmitt (eds),Nonmonotonic and Induction Logics, 2nd Int. Workshop, Springer LNCS 659, 1992.",{},{"id":26,"text":3043,"url":26,"identifiers":3044},"Brewka, G.: Adding priorities and specificity to default logic, in C. MacNish, D. Pearce and L. M. Pereira (eds),Logics in Artificial Intelligence, European Workshop, JELIA'94, York, UK, Springer LNAI 838, 1994, pp. 247?260.",{"doi":3045},"10.1007\u002FBFb0021977",{"id":26,"text":3047,"url":26,"identifiers":3048},"Brewka, G.: Preferred subtheories: An extended logical framework for default reasoning, inProc. 11th Int. Joint Conf. on Artificial Intelligence, Detroit, MI, 1989.",{},{"id":26,"text":3050,"url":26,"identifiers":3051},"Brewka, G.:Nonmonotonic Reasoning: Logical Foundations of Commonsense, Cambridge University Press, Cambridge, 1991.",{},{"id":26,"text":3053,"url":26,"identifiers":3054},"Delgrande, J. P. and Jackson, W. K.: Default logic revisited, inProc. 2nd Int. Conf. on Knowledge Representation and Reasoning, Cambridge, MA, 1991.",{},{"id":26,"text":3056,"url":26,"identifiers":3057},"Junker, U. and Brewka, G.: Handling partially ordered defaults in TMS, inProc. 1st European Conf. on Symbolic and Quantitative Approaches for Uncertainty, Marseille, France, 1991.",{"doi":3058},"10.1007\u002F3-540-54659-6_91",{"id":26,"text":3060,"url":26,"identifiers":3061},"Kobsa, A.: The SB-ONE knowledge representation workbench, inPreprint of the Workshop on Formal Aspects of Semantic Networks, Two Harbours, CA, 1989.",{},{"id":26,"text":3063,"url":26,"identifiers":3064},"Lifschitz, V.: Computing circumscription, inProc. 9th Int. Joint Conf. on Artificial Intelligence, Los Angeles, CA, 1985.",{},{"id":26,"text":3066,"url":26,"identifiers":3067},"Mays, E. and Dionne, B: Making KR systems useful, inTerminological Logic Users Workshop, Proc., KIT-Report 95, TU, Berlin, 1991, pp. 11?12.",{},{"id":26,"text":3069,"url":26,"identifiers":3070},"MacGregor, R.: Statement of interest, in K. von Luck, B. Nebel and C. Peltason (eds),Statement of Interest 2nd Int. Workshop on Terminological Logics, Document D-91-13, DFKI Kaiserslautern, 1991.",{},{"id":26,"text":3072,"url":26,"identifiers":3073},"Ginsberg, M. L. (ed.),Readings in Nonmonotonic Reasoning, Morgan Kaufmann, Los Altos, CA, 1987.",{},{"id":26,"text":3075,"url":26,"identifiers":3076},"?BACK, System presentation, inTerminological Logic Users Workshop, Proc., KIT-Report 95, TU, Berlin, 1991, p. 186.",{},{"id":26,"text":3078,"url":26,"identifiers":3079},"Padgham, L. and Nebel, B.: Combining classification and nonmonotonic inheritance reasoning: A first step, in Z. W. Ras and J. Komorowski (eds),Methodologies for Intelligent Systems (ISMIS'93), North-Holland, Amsterdam, 1993.",{},{"id":26,"text":3081,"url":26,"identifiers":3082},"Peltason, C., v. Luck, K. and Kindermann, C. (Org.):Terminological Logic Users Workshop, Proc., KIT Report 95, TU, Berlin, 1991.",{},{"id":26,"text":2413,"url":26,"identifiers":3084},{"doi":2415},{"id":26,"text":3086,"url":26,"identifiers":3087},"Reiter, R. and Criscuolo, G.: On interacting defaults, inProc. 7th Int. Joint Conf. on Artificial Intelligence, 1981.",{}]