Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book constitutes the refereed proceedings of the 14th International Symposium on Practical Aspects of Declarative Languages, PADL 2012, held in Philadelphia, PA, USA, in January 2012, co-located with POPL 2012, the 39th Symposium on Principles of Programming Languages. The 38 revised technical papers presented together with 3 application papers were carefully reviewed and selected from 52 submissions. The volume features original work emphasizing new ideas and approaches pertaining to applications and implementation techniques of declarative languages and addresses topics such as innovative applications of declarative languages, declarative domain-specific languages and applications, practical applications of theoretical results, new language developments and their impact on applications, evaluation of implementation techniques on practical applications, novel implementation techniques relevant to applications, novel uses of declarative languages in the classroom, and practical experiences."

"This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Declarative Agent Languages and Technologies, DALT 2011, held in Taipei, Taiwan, in May 2011. The volume contains 6 revised selected presented at DALT 2011, 7 best papers from the DALT series over the years, explaining how the research developed and how it influenced and impacted the community, the state-of-the-art and subsequent work, and two invited papers from the DALT Spring School, which took place in April 2011."

"The festschrift includes several reminiscences and introductory essays describing Professor Sergot's achievements, followed by a series of articles on logic programming, temporal reasoning and action languages, artificial intelligence and law, deontic logic and norm-governed systems, and logical approaches to policies."

"This monograph deals with aspects of the computer programming process that involve techniques derived from mathematical logic. The author focuses on proving that a given program produces the intended result whenever it halts, that a given program will eventually halt, that a given program is partially correct and terminates, and that a system of rewriting rules always halts. Also, the author describes the intermediate behavior of a given program, and discusses constructing a program to meet a given specification."

"We specifically focus on the following issues: 1. An important question when modeling continuous optimization problems is how we should handle overconstrained problems, i.e. problems that have no solutions. 2. Users of a programming language often want a rich language that is easy to model in. 3. A well-known technique for solving ASP consists of translating a program P to a propositional theory whose models exactly correspond to the answer sets of P. "