# tip tongue (blogs) — RSS Amplifier Recent posts from the 1 feeds in the RSS Amplifier directory that cover tip tongue. Page: Feed: --- ## [Pull Down Programming Complexity with Kubrick](https://gfrison.com/2026/pull-down-programming-complexity-kubrick) _2026-01-30 · Giancarlo Frison · Accidental Pitch ♮_ AI tools and programmers struggle with complexity given by the programming ecosystem itself. Kubrick is a declarative language designed to reduce accidental complexity through logic programming, functional paradigms, and relation algebra. Lower the friction, and generators work better. Make easy things easily while keeping expressiveness intact. ## [Adaptive Programming Systems for Humans and AI](https://gfrison.com/2025/adaptive-programming-systems) _2025-09-14 · Giancarlo Frison · Accidental Pitch ♮_ How programming systems can adapt to evolving user and AI needs? Drawing parallels with architecture, I enphasize the importance of flexibility, open authorship, and user empowerment, and discusses challenges faced by both humans and AI in program synthesis ## [Hybrid AI for Generating Programs: a Survey](https://gfrison.com/2025/hybrid-ai-for-generating-programs) _2025-05-02 · Giancarlo Frison · Accidental Pitch ♮_ Computer programming is a specialized activity that requires long training and experience to match productivity, precision and integration. It hasn't been a secret for AI practitioners to ultimately create software tools that can facilitate the role of programmers. The branch of AI dedicated to automatically generate programs from examples or some sort of specification is called program synthesis.… ## [Rhetoric LLMs and Argumentation](https://gfrison.com/2024/12/01/rhetoric-llms-argumentation) _2024-11-30 · Giancarlo Frison · Accidental Pitch ♮_ How much are LLMs persuasive? Here a brief excursus on how automatic argumentation can benefit from LLMs linguistic skills ## [Defeasible Logic for Automatic Argumentation](https://gfrison.com/2024/12/01/defeasible-logic-automatic-argumentation) _2024-11-30 · Giancarlo Frison · Accidental Pitch ♮_ Computational argumentation uses strict and defeasible rules to model the logical structure of arguments and evaluate their validity by considering facts, counterarguments, and preferences. Let's figure it out...