检索结果-内蒙古大学图书馆

24th International Workshop on Multi-Agent-Based Simulation (MABS)

作者： Edmonds, Bruce Polhill, J. Gareth Manchester Metropolitan Univ Ctr Policy Modelling Manchester Lancs England James Hutton Inst Aberdeen Scotland

ISBN: (纸本)9783031610332;9783031610349

We argue for a combination of declarative/constraint and imperative programming approaches for MABS: a declarative layer that specified the ontology, assumptions, types, internal and checks for a simulation and the imperative code that satisfied the statements of the declarative layer - instantiating the behaviours. Such a system would be a generalisation of common elements of existing simulations. The two layers would be separately developed and communicated but work together. Using such a system one might: (a) start by importing an ontology of entities that have been previously agreed within a field, (b) work with domain experts to implement declarative statements that reflect what is known about the system, (c) develop the implementation starting with declarative internal checks and the outlines of the implementation, (d) slowly add imperative statements to fill in details, (e) finally when the simulation has been completely verified, the declarative layer could be switched off to allow faster exploration. This would ensure for a more reliable simulation and ensure its consistency with common ontologies etc. It would facilitate: joining models together with fewer mistakes, comparing models, provide enhanced and flexible error checking, make modules more reusable, allow for rapid prototyping, support the automation of modelling tools/add-ons, and allow the selective exploration of all possible behaviours of a sub-model using constraint programming techniques. Examples are given of previous work that moves in this direction.

关键词： Constraint programming declarative programming imperative programming Multi-Agent-Based Simulation MABS model joining model comparison internal checks unit tests strong typing

来源：评论

学校读者我要写书评

暂无评论

An Epistemic Model-Based Tutor for imperative programming 22nd

An Epistemic Model-Based Tutor for Imperative Programming

引用

22nd International Conference on Artificial Intelligence in Education (AIED) - Mind the Gap - AIED for Equity and Inclusion

作者： Kumar, Amruth N. Ramapo Coll Mahwah NJ 07430 USA

ISBN: (纸本)9783030782702;9783030782696

We developed a tutor for imperative programming in C++. It covers algorithm formulation, program design and coding - all three stages involved in writing a program to solve a problem. The design of the tutor is epistemic, i.e., true to real-life programming practice. The student works through all the three stages of programming in interleaved fashion, and within the context of a single code canvas. The student has the sole agency to compose the program and write the code. The tutor uses goals and plans as prompts to scaffold the student through the programming process designed by an expert. It provides drill-down immediate feedback at the abstract, concrete and bottom-out levels at each step. So, by the end of the session, the student is guaranteed to write the complete and correct program for a given problem. We used model-based architecture to implement the tutor because of the ease with which it facilitates adding problems to the tutor. In a preliminary study, we found that practicing with the tutor helped students solve problems with fewer erroneous actions and less time.

关键词： programming tutor imperative programming Model-based architecture

来源：评论

学校读者我要写书评

暂无评论

Integrating a General Search Agent into an imperative programming Language 4

Integrating a General Search Agent into an Imperative Progra...

引用

4th IEEE International Conference on Artificial Intelligence and Knowledge Engineering (AIKE)

作者： Smith, James Henderson, Chris Bansal, Ajay Arizona State Univ Fulton Sch Engn Mesa AZ 85212 USA

ISBN: (纸本)9781665437363

Search is one of the more common strategies used by problem-solving agents. For many hard problems, a backtracking search can be the most effective approach for finding a solution. Logic programming languages provide, as a core feature of the language, the mechanics for the search behind the scenes without requiring the user to specify the algorithm. However, this functionality has been generally left out of the core features of imperative programming languages. In this work we propose integrating a search agent into an imperative programming language through a search construct in the syntax. By doing so, our intention is that the user may apply a model-based approach to problem solving. We extend the Go programming language with this search construct and develop an agent to perform the search. The algorithm behind the search is implicitly handled by the agent. We demonstrate the effectiveness of this search construct through solutions to an exhaustive search over a file-system, the NQueens problem, and the monkey and the bananas problem.

关键词： Declarative programming imperative programming problem-solving agent search agent backtracking search

来源：评论

学校读者我要写书评

暂无评论

Reactive imperative programming with Dataflow Constraints 11

Reactive Imperative Programming with Dataflow Constraints

引用

2th ACM International Conference on Systems, programming, Languages, and Applications: Software for Humanity (SPLASH)

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Univ Roma La Sapienza Dept Comp & Syst Sci Rome Italy

ISBN: (纸本)9781450309400

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes of their environment. Researchers have long investigated how to take advantage of dataflow constraints by embedding them into procedural languages. Previous mixed imperative/dataflow systems, however, require syntactic extensions or libraries of ad hoc data types for binding the imperative program to the dataflow solver. In this paper we propose a novel approach that smoothly combines the two paradigms without placing undue burden on the programmer. In our framework, programmers can define ordinary statements of the imperative host language that enforce constraints between objects stored in special memory locations designated as "reactive". Differently from previous approaches, reactive objects can be of any legal type in the host language, including primitive data types, pointers, arrays, and structures. Statements defining constraints are automatically re-executed every time their input memory locations change, letting a program behave like a spreadsheet where the values of some variables depend upon the values of other variables. The constraint solving mechanism is handled transparently by altering the semantics of elementary operations of the host language for reading and modifying objects. We provide a formal semantics and describe a concrete embodiment of our technique into C/C++, showing how to implement it efficiently in conventional platforms using off-the-shelf compilers. We discuss common coding idioms and relevant applications to reactive scenarios, including incremental computation, observer design pattern, and data structure repair. The performance of our implementation is compared to ad hoc problem-specific change propagation algorithms, as well as to language-centric approaches such as self-adjusting computation and subject/observer communication mechanisms, showing that the proposed approa

关键词： Reactive programming dataflow programming imperative programming constraint solving incremental computation observer design pattern data structure repair

来源：评论

学校读者我要写书评

暂无评论

Reactive imperative programming with Dataflow Constraints

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2015年第1期37卷 3-3页

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Univ Roma La Sapienza Dept Comp Control & Management Engn Antonio Ruber I-00185 Rome Italy Univ Roma La Sapienza Dept Comp Sci I-00198 Rome Italy

Dataflow languages provide natural support for specifying constraints between objects in dynamic applications, where programs need to react efficiently to changes in their environment. In this article, we show that one-way dataflow constraints, largely explored in the context of interactive applications, can be seamlessly integrated in any imperative language and can be used as a general paradigm for writing performance-critical reactive applications that require efficient incremental computations. In our framework, programmers can define ordinary statements of the imperative host language that enforce constraints between objects stored in special memory locations designated as "reactive." Reactive objects can be of any legal type in the host language, including primitive data types, pointers, arrays, and structures. Statements defining constraints are automatically re-executed every time their input memory locations change, letting a program behave like a spreadsheet where the values of some variables depend on the values of other variables. The constraintsolving mechanism is handled transparently by altering the semantics of elementary operations of the host language for reading and modifying objects. We provide a formal semantics and describe a concrete embodiment of our technique into C/C++, showing how to implement it efficiently in conventional platforms using off-the-shelf compilers. We discuss common coding idioms and relevant applications to reactive scenarios, including incremental computation, observer design pattern, data structure repair, and software visualization. The performance of our implementation is compared to problem-specific change propagation algorithms, as well as to language-centric approaches such as self-adjusting computation and subject/observer communication mechanisms, showing that the proposed approach is efficient in practice.

关键词： Algorithms Design Experimentation Languages Reactive programming dataflow programming imperative programming one-way dataflow constraints constraint solving incremental computation observer design pattern data structure repair software visualization

来源：评论

学校读者我要写书评

暂无评论

Reactive imperative programming with Dataflow Constraints

引用

ACM SIGPLAN NOTICES 2011年第10期46卷 407-426页

作者： Demetrescu, Camil Finocchi, Irene Ribichini, Andrea Sapienza Univ Rome Dept Comp & Syst Sci Rome Italy Sapienza Univ Rome Dept Comp Sci Rome Italy

关键词： Algorithms design experimentation languages Reactive programming dataflow programming imperative programming constraint solving incremental computation observer design pattern data structure repair

来源：评论

学校读者我要写书评

暂无评论

Alma-0: An imperative language that supports declarative programming

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1998年第5期20卷 1014-1066页

作者： Apt, KR Brunekreef, J Partington, V Schaerf, A CWI NL-1090 GB Amsterdam Netherlands Univ Amsterdam Dept Math Comp Sci Phys & Astron NL-1018 TV Amsterdam Netherlands Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy

We describe here an implemented small programming language, called Alma-0, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions encourage declarative programming and make it a more attractive vehicle for problems that involve search. We illustrate the use of Alma-0 by presenting solutions to a number of classical problems, including alpha-beta search, STRIPS planning, knapsack, and Eight Queens. These solutions are substantially simpler than their counterparts written in the imperative or in the logic programming style and can be used for different purposes without any modification. We also discuss here the implementation of Alma-0 and an operational, executable, semantics of a large subset of the language.

关键词： languages declarative programming imperative programming search

来源：评论

学校读者我要写书评

暂无评论

A Generalized Search Construct for imperative Languages to Facilitate Declarative programming

引用

INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING 2022年第3期16卷 315-338页

作者： Smith, James Henderson, Chris Bansal, Ajay Arizona State Univ Sch Comp & Augmented Intelligence 1151 S Forest Ave Tempe AZ 85282 USA

Search is one of the more common strategies used by problem-solving agents. For many hard problems, a backtracking search can be the most effective approach for finding a solution. Logic programming languages provide, as a core feature of the language, the mechanics for the search behind the scenes without requiring the user to specify the algorithm. However, this functionality has been generally left out of the core features of imperative programming languages. In this work, we propose integrating a search agent into an imperative programming language through a search construct in the syntax. By doing so, our intention is that the user may apply a declarative approach to problem solving. We extend the Go programming language with this search construct and develop an agent to perform the search. The algorithm behind the search is implicitly handled by the agent. We demonstrate the effectiveness of this search construct through solutions to an exhaustive search over a file-system, the NQueens problem, and the monkey and the bananas problem. To evaluate the performance of our agent, we compare its runtime performance against two of the common Prolog implementations, SWI-Prolog and GNU Prolog.

关键词： Declarative programming imperative programming problem-solving agent search agent backtracking search

来源：评论

学校读者我要写书评

暂无评论

Perspectives of semantic modeling in categories

引用

Journal of King Saud University - Computer and Information Sciences 2025年第3期37卷 1-28页

作者： Steingartner, William Faculty of Electrical Engineering and Informatics Technical University of Košice Letná 1/9 Košice 04200 Slovakia

This paper explores the domain of semantic modeling, emphasizing the thoughtful influence of category theory on imperative programming. We aim to present a formal semantics model by seamlessly integrating categorical concepts. A core focus of this study is clarifying relationships between objects representing the memory states as denotation functions. Extending our exploration, we examine categorical modeling within the context of structural operational semantics. An important aspect is the purposeful use of coalgebras to express program behavior, especially concerning memory configurations. Our methodology involves modeling denotation within categories, considering input/output values and state dynamics. This synthesis leads to a comprehensive and robust semantic framework. Notably, our research concludes with the development of a category tailored for memory configurations, effectively mirroring program transitions. Execution dynamics finds representation through a customized polynomial endofunctor, accommodating a range of transition types. Importantly, our study contributes mathematical rigor to the domain of program semantics, offering practical applications across various IT challenges, including recursive calculations, function relationships, and component program systems. Significantly, this study underscores the enduring relevance of category theory in the dynamic landscape of semantic modeling, offering insights into potential practical applications within programming and related fields. © The Author(s) 2025.

关键词： Categorical modeling Category theory Denotational semantics imperative programming Semantic modeling System engineering

来源：评论

学校读者我要写书评

暂无评论

Alma-O: an imperative language that supports declarative programming

引用

ACM Transactions on programming Languages and Systems 1998年第5期20卷 1014–1066页

作者： Krzysztof R. Apt Jacob Brunekreef Vincent Partington Andrea Schaerf CWI and University of Amsterdam University of Amsterdam Università di Roma "La Sapienza"

We describe here an implemented small programming language, called Alma-O, that augments the expressive power of imperative programming by a limited number of features inspired by the logic programming paradigm. These additions encourage declarative programming and make it a more attractive vehicle for problems that involve search. We illustrate the use of Alma-O by presenting solutions to a number of classical problems, including α-β search, STRIPS planning, knapsack, and Eight Queens. These solutions are substantially simpler than their counterparts written in the imperative or in the logic programming style and can be used for different purposes without any modification. We also discuss here the implementation of Alma-O and an operational, executable, semantics of a large subset of the language.

关键词： declarative programming imperative programming search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：